scispace - formally typeset
Search or ask a question
Author

Grzegorz Rozenberg

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
More filters
Journal ArticleDOI
TL;DR: All closure properties of families in the Chomksy hierarchy under both non-iterated and iterated PA-matching and overlapping operations are settled.

11 citations

Book ChapterDOI
01 Jan 2001
TL;DR: The main result shows that the behavior and realization constructions are adjoint functors leading to an equivalence of the categories MNet of M-nets and RFGraph of reflexive F-graphs, which implies that thebehavior construction preserves colimits so that the marking graph construction using F- graphs is compositional.
Abstract: Starting from the algebraic view of Petri nets as monoids (as advocated by Meseguer and Montanari in [MM90]) we present the marking graphs of place transition nets as free monoid graphs and the marking graphs of specific elementary nets as powerset graphs. These are two important special cases of a general categorical version of Petri nets based on a functor M, called M-nets. These nets have a compositional marking graph semantics in terms of F-graphs, a generalization of free monoid and powerset graphs. Moreover we are able to characterize those F-graphs, called reflexive F-graphs, which are realizable by corresponding M-nets. The main result shows that the behavior and realization constructions are adjoint functors leading to an equivalence of the categories MNet of M-nets and RFGraph of reflexive F-graphs. This implies that the behavior construction preserves colimits so that the marking graph construction using F-graphs is compositional.In addition to place transition nets and elementary nets we provide other interesting applications of M-nets and F-graphs. Moreover we discuss the relation to classical elementary net systems. The behavior and realization constructions we have introduced are compatible with corresponding constructions for elementary net systems (with initial state) and elementary transition systems in the sense of [NRT92].

11 citations

Journal ArticleDOI
01 Nov 2001
TL;DR: Computational models based on natural phenomena have gained popularity, and many perceive them to hold the promise for building more powerful massively parallel computers that can provide considerably more computing power than the authors currently have.
Abstract: Computational models based on natural phenomena have gained popularity. Other techniques are more esoteric, such as DNA-based and quantum computation. Many perceive them to hold the promise for building more powerful massively parallel computers that can provide considerably more computing power than we currently have.

11 citations

Journal ArticleDOI
TL;DR: This paper investigates the basic properties of the class of neighborhood-uniform nodel label controlled (NUNLC) graph grammars and demonstrates that a number of basic properties are decidable for theclass of NUNLC grammar—many of them are undecidable in the whole class of NLC Grammars.
Abstract: This paper investigates the basic properties of the class of neighborhood-uniform nodel label controlled (NUNLC) graph grammars The class of NUNLC grammars is distinguished by requiring a very natural restriction on the connection relations of NLC grammars The restriction implies “Church-Rosser property” of derivations in an NUNLC grammar, which makes the class of NUNLC grammars “technically easier” to investigate A number of combinatorial properties of the languages generated by the class of NUNLC grammars are proved Also, it is demonstrated that a number of basic properties are decidable for the class of NUNLC grammars—many of them are undecidable in the whole class of NLC grammars

11 citations


Cited by
More filters
Journal ArticleDOI
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 ArticleDOI
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