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
TL;DR: This paper presents a meta-modelling framework that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually cataloging and computing the physical world around us.
Abstract: Natural computing is the field of research that investigates models and computational techniques inspired by nature and, dually, attempts to understand the world around us in terms of information processing. It is a highly interdisciplinary field that connects the natural sciences with computing science, both at the level of information technology and at the level of fundamental research, [98]. As a matter of fact, natural computing areas and topics come in many flavours, including pure theoretical research, algorithms and software applications, as well as biology, chemistry and physics experimental laboratory research. In this review we describe computing paradigms abstracted from natural phenomena as diverse as self-reproduction, the functioning of the brain, Darwinian evolution, group behaviour, the immune system, the characteristics of life, cell membranes, and morphogenesis. These paradigms can be implemented either on traditional electronic hardware or on alternative physical media such as biomolecular (DNA, RNA) computing, or trapped-ion quantum computing devices. Dually, we describe several natural processes that can be viewed as information processing, such as gene regulatory networks, protein-protein interaction networks, biological transport networks, and gene assembly in unicellular organisms. In the same vein, we list efforts to understand biological systems by engineering semi-synthetic organisms, and to understand the universe from the point of view of information processing. This review was written with the expectation that the reader is a computer scientist with limited knowledge of natural sciences, and it avoids dwelling on the minute details of

228 citations

01 Jan 2007
TL;DR: The paper provides the basic definitions, illustrates them by biology and computer science oriented examples, relates reaction systems to some traditional models of computation, and proves some basic properties of reaction systems.
Abstract: Interactions between biochemical reactions lie at the heart of functioning of a living cell. In order to formalize these interactions we introduce reaction systems. We motivate them by explicitely stating a number of assumptions/axioms that (we believe) hold for a great number of biochemical reactions - we point out that these assumptions are very different from the ones underlying traditional models of computation. The paper provides the basic definitions, illustrates them by biology and computer science oriented examples, relates reaction systems to some traditional models of computation, and proves some basic properties of reaction systems.

201 citations

Book
01 Jan 1986
TL;DR: Investigations into Drosophila Wing Development - Results from a Lindenmayer Model and the Theoretical Basis of the Transplantation Experiment.
Abstract: Investigations into Drosophila Wing Development - Results from a Lindenmayer Model.- Fibonacci Words - A Survey.- Planar Map Generation by Parallel Binary Fission/Fusion Grammars.- Modular Trellises.- A New Proof for the DOL Sequence Equivalence Problem and its Implications.- On Compound Lindenmayer Systems.- Graph Grammars with Application Conditions.- The ETOL Hierarchy is in the OI Hierarchy.- Polyhedral Cell Shapes.- On Cyclically Overlap-Free Words in Binary Alphabets.- The Theoretical Basis of the Transplantation Experiment.- Fixed and Stationary ?-Words and ?-Languages.- DOL Schemes and Recurrent Words.- Stochastic OL Systems and Formal Power Series.- Complexity of L-Systems.- Compartmental Hybrid State Production-Diffusion Systems with Application to Prestalk-Prespore Pattern Regulation in Cellular Slime Molds.- Hierarchical Aspects of Plant Development.- Rule Trees Represent Derivations in Edge Replacement Systems.- Languages Defined by Indian Parallel Systems.- L Systems and NLOG-Reductions.- The Parikh-Boundedness of ETOL Languages of Finite Index.- Computer Networks with Compact Routing Tables.- Unconventional Leaves.- A Uniform Model for the Growth of Biological Organisms: Cooperating Sequential Processes.- Graph Technology Applied to a Software Project.- Some Systems for Map Generation.- A Programming Language for Lindenmayer Systems.- A Note on Significance of Cellular Interaction in L-System.- EOL Grammars and Search Trees.- Variation in Inflorescence Structure in Cotoneaster Franchetti.- Partial Path Groups and Parallel Graph Contractions.- When L was Young.- Equivalence Problems for Regular Sets of Word Morphisms.- Parentheses Grammars and Lindenmayer Grammars.- Array Languages and Lindenmayer Systems - A Survey.- Symmetric Distributed Termination.- Development, Growth and Time.- On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph Language.- Graph-Controlled Systems - An Extension of OL Systems.

191 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