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
TL;DR: The effect of various conditions on selectors, which define the way that rewriting is performed, are studied to formalize the notion of ‘using information about the context’ during the rewriting process.
31 citations
TL;DR: Culik and Salomaa as mentioned in this paper showed that the equality set of two injective morphisms over a binary alphabet is always either of the above form or of the form (uw ∗ v) ∗ for some words u, w, and v. In fact, a test set can always be chosen to contain no more than three words.
31 citations
13 Dec 2004
TL;DR: Natural Computing is a general term referring to computing taking place in nature and computing inspired by nature as mentioned in this paper, and it is used to describe both the original/classical point of view of computation as calculation and to account for (be inspired by) processes, e.g., life processes.
Abstract: Natural Computing is a general term referring to computing taking place in nature and computing inspired by nature. There is a huge surge of research on natural computing, and one of the reasons for it is that two powerful and growing research trends happen at the same time (and actually strengthen and influence each other). These two trends are:
(1) trying to understand the functioning of a living cell from the cell-as-a-whole perspective,
(2) trying to free the theory of computation from classical paradigms (the ongoing transition to the so called “non-classical computation”) in order to explore a much broader notion of computation. This broader notion should take into account not only the original/classical point of view of “computation as calculation” but should also account for (be inspired by) processes, e.g., life processes, taking place in nature.
31 citations
01 Jun 2008
TL;DR: An overview of the framework of graph transformation units which provides syntactic and semantic means for analyzing, modeling, and structuring all kinds of graph processing and graph transformation.
Abstract: In this paper, we give an overview of the framework of graph transformation units which provides syntactic and semantic means for analyzing, modeling, and structuring all kinds of graph processing and graph transformation.
31 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