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
01 Sep 1996
8 citations
Book•
02 Apr 2002
TL;DR: The Branching Point Approach to the Marked Post Correspondence Problem as discussed by the authors is a branching point approach to the problem of finding the binary relations contained in a binary relation in a Binary Relation.
Abstract: Words, Languages, Automata.- Balanced Grammars and Their Languages.- Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids.- The Delta Operation: From Strings to Trees to Strings.- Infinite Solutions of Marked Post Correspondence Problem.- The Branching Point Approach to Conway's Problem.- A Survey of Some Quantitative Approaches to the Notion of Information.- Nondeterministic Trajectories.- Binary Patterns in Infinite Binary Words.- Graph Transformations.- A Sight-seeing Tour of the Computational Landscape of Graph Transformation.- Local Action Systems and DPO Graph Transformation.- Bisimulation Equivalences for Graph Grammars.- Petri Nets.- High-Level Net Processes.- Petri Net Control for Grammar Systems.- Regular Event Structures and Finite Petri Nets: A Conjecture.- Concurrent Computing.- Towards Team-Automata-Driven Object-Oriented Collaborative Work.- Grammars as Processes.- Temporal Concurrent Constraint Programming: Applications and Behavior.- Molecular Computing.- Rewriting P Systems with Conditional Communication.- An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation.- Upper Bounds for Restricted Splicing.- Codes, Involutions, and DNA Encodings.- DNA Manipulations in Ciliates.- A Magic Pot : Self-assembly Computation Revisited.
8 citations
TL;DR: A new type of grammar called a DOS system is introduced and investigated, which formalizes the notion of a context free grammar without variables that is generatively deterministic.
Abstract: A new type of grammar called a DOS system is introduced and investigated. Essentially it formalizes the notion of a context free grammar without variables that is generatively deterministic.
8 citations
TL;DR: This paper provides an analytical and experimental study of stability in reaction systems, an abstract model of biochemical reactions in the living cell within a framework of finite (though often large) discrete dynamical systems.
Abstract: Reaction systems are an abstract model of biochemical reactions in the living cell within a framework of finite (though often large) discrete dynamical systems. In this setting, this paper provides an analytical and experimental study of stability. The notion of stability is defined in terms of the way in which small perturbations to the initial state of a system are likely to change the system's eventual behavior. At the stable end of the spectrum, there is likely to be no change; but at the unstable end, small perturbations take the system into a state that is probabilistically the same as a randomly selected state, similar to chaotic behavior in continuous dynamical systems.
8 citations
TL;DR: Two efficient algorithms for evaluating precycles and defects are given: one is an algorithm due to Contejean and Devie, the other is a novel branch-and-bound tree search procedure.
8 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