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
••
04 Oct 198236 citations
••
TL;DR: It is shown that the usual form of pumping is very far from implying regularity but that a strengthened pumpingproperty, the block pumping property, is equivalent to regularity.
Abstract: It is well known that regularity of a language implies certain properties known as pumping lemmas or iteration theorems. However, the question of a converse result has been open. We show that the usual form of pumping is very far from implying regularity but that a strengthened pumping property, the block pumping property, is equivalent to regularity. The proof involves use of the finite version of Ramsey’s theorem. We compare our results with recent results of Jaffe and Beauquier and state some open questions.
34 citations
Cited by
More filters
••
01 Apr 1989TL;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
•
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
•
18 Dec 1991
3,409 citations