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
Journal Article•
[...]
TL;DR: The theory of square systems provides a unifying framework for studying decompositions of systems based on hierarchical families of subsets - hence for tree-like decomposites.
Abstract: The notion of a square system is introduced and investigated - it is based on a quaternary relation satisfying certain symmetry conditions. The theory of square systems provides a unifying framework for studying decompositions of systems based on hierarchical families of subsets - hence for tree-like decompositions.
12 citations
Journal Article•
12 citations
12 citations
TL;DR: This paper investigates variants ofsplicing inspired partly by regulating mechanisms customarily studied in language theory, partly by imposing restrictions on the pairs to be spliced or on the result of splicing, and gives new characterizations for families in the Chomsky hierarchy and for closure properties in general.
Abstract: Splicing is a new powerful tool, stemming originally from molecular genetics but investigated extensively also in language theory. In this paper we investigate variants of splicing inspired partly by regulating mechanisms customarily studied in language theory, partly by imposing restrictions on the pairs to be spliced or on the result of splicing. The Chomsky hierarchy constitutes a very suitable test bed for the resulting families, because it is classical and well understood. In contrast to the usual, nonrestricted splicing, we find several cases when the families of regular or of context-free languages are not closed under the new types of splicing. On the other hand, our results give new characterizations for families in the Chomsky hierarchy and for closure properties in general.
11 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