Author
Grzegorz Rozenberg
Other affiliations: Åbo Akademi University, University of Warsaw, University of Antwerp ...read more
Bio: Grzegorz Rozenberg is an academic researcher from Leiden University. The author has contributed to research in topics: Petri net & Formal language. The author has an hindex of 81, co-authored 679 publications receiving 31378 citations. Previous affiliations of Grzegorz Rozenberg include Åbo Akademi University & University of Warsaw.
Papers published on a yearly basis
Papers
More filters
01 Jan 1990
TL;DR: Non-interleaving observations of (runs of) a POT are investigated, in particular when the POT satisfies the above properties, viz. reference passing and handshaking.
Abstract: Parallel object-based systems are modelled by POTs, where a POT is a Petri net with an additional structure imposed on its places (POT abbreviates Parallel Object-based Transition system). In a POT, parallelism, objects, references, communication, and creation are handled explicitly. Some basic properties of object-based systems are formalized as properties of POTs, viz. properties concerning reference passing and handshaking. Non-interleaving observations of (runs of) a POT are investigated, in particular when the POT satisfies the above properties.
6 citations
6 citations
07 Oct 1996
TL;DR: Several types of matching systems are shown to have the same power as finite automata, one variant is proven to be equivalent to Turing machines, and another one is found to have a strictly intermediate power.
Abstract: We introduce the matching systems, a computability model which is an abstraction of the way of using the Watson-Crick complementarity when computing with DNA in the Adleman style. Several types of matching systems are shown to have the same power as finite automata, one variant is proven to be equivalent to Turing machines, and another one is found to have a strictly intermediate power.
5 citations
02 Dec 1986
TL;DR: Complexity problems concerning event structure languages and dependence graph languages can be reduced to complexity problems concerning RDNLC languages.
Abstract: Regular directed node-label controlled graph grammars (RDNLC grammars) originated from the need for a formal description of event structure languages (related to Petri nets) and of dependence graph languages (related to trace languages). In this framework complexity problems concerning event structure languages and dependence graph languages can be reduced to complexity problems concerning RDNLC languages.
5 citations
TL;DR: Dans cet article, le rapport entre 2 lignes du developpement a l'interieur de la theorie des grammaires de graphes est discute.
5 citations
Cited by
More filters
01 Apr 1989
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Abstract: Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis. In particular, one section is devoted to marked graphs, the concurrent system model most amenable to analysis. Introductory discussions on stochastic nets with their application to performance modeling, and on high-level nets with their application to logic programming, are provided. Also included are recent results on reachability criteria. Suggestions are provided for further reading on many subject areas of Petri nets. >
10,755 citations
Journal Article•
9,185 citations
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
7,096 citations
Book•
18 Dec 1991
3,409 citations