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
01 Feb 2003
TL;DR: This work defines team automata in a mathematically precise way in terms of component automata which synchronize on certain executions of actions to serve as a formal framework for modeling both the conceptual and the architectural level of groupware systems.
Abstract: Team automata have been proposed in Ellis (1997) as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team automata in a mathematically precise way in terms of component automata which synchronize on certain executions of actions. At the conceptual level, our model serves as a formal framework in which basic groupware notions can be rigorously defined and studied. At the architectural level, team automata can be used as building blocks in the design of groupware systems.

72 citations

Journal ArticleDOI
TL;DR: It is shown that the class of boundary graph languages is closed under the operation of edge contraction, where the label of the edge indicates whether or not the edge should be contracted.
Abstract: Context-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree have the same power, both for generating sets of graphs and for generating sets of hypergraphs. Arbitrary boundary graph grammars have more graph generating power than context-free hypergraph grammars, but they have the same hypergraph generating power. To obtain these results, several normal forms for boundary graph grammars are given. It is also shown that the class of boundary graph languages is closed under the operation of edge contraction, where the label of the edge indicates whether or not the edge should be contracted.

72 citations

Journal ArticleDOI
TL;DR: The theoretical developments of DNA computing are demonstrated by discussing a number of selected topics and an introduction to the basic structure of DNA and the basic DNA processing tools is given.

72 citations

Book ChapterDOI
01 Jan 1987
TL;DR: In this article, the authors consider two ways of recording the behavior of an elementary net system (EN system): via sequential observations and via non-sequential observations, and discuss each of the three approaches and then relate them to each other.
Abstract: We consider two ways of recording the behaviour of an elementary net system (EN system): via sequential observations and via non-sequential observations. In the sequential point of view each record of the behaviour of an EN system is a string of event occurrences (called a firing sequence) as registered by a sequential observer. In the nonsequential point of view we can define the behaviour of an EN system by either extracting causal order of events from firing sequences (obtaining firing traces) or by recording all nonsequential observations of event occurrences and of resulting holdings of conditions (each such record is called a process). In our contribution we discuss each of the three approaches and then relate them to each other.

71 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