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
16 Nov 1998
TL;DR: Within this framework, a modification of Yannakakis’ result is proved and used to show NP-completeness for the embedding problem, and the 3-colourability problem is proved.
Abstract: In the context of graph transformations we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of graphs through local transformations of the vertices. We compare the complexity of a number of problems on graphs with the complexity of these problems extended to the set of switches of a graph. Within this framework, we prove a modification of Yannakakis’ result and use it to show NP-completeness for the embedding problem. Finally we prove NP-completeness for the 3-colourability problem.
20 citations
07 Jun 2004
TL;DR: The study of parallelism contributes to a better understanding of the nature of gene assembly, and in particular it provides a new insight in the complexity of this process.
Abstract: The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organisms. This process is fascinating from the computational point of view, with ciliates even using the linked list data structure. Three molecular operations (ld,hi, and dlad) have been postulated for the gene assembly process. We initiate here the study of parallelism of this process by investigating several natural questions, such as: when can a number of operations be applied in parallel to a gene pattern, or how many steps are needed to assemble in parallel a micronuclear gene. We believe that the study of parallelism contributes to a better understanding of the nature of gene assembly, and in particular it provides a new insight in the complexity of this process.
19 citations
[...]
TL;DR: This paper investigates the class of angular 2-structures which results by requiring that the primitivity is forbidden on the lowest possible level, i.e. it is required that no substructure on three elements is primitive.
19 citations
19 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