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
BookDOI
01 Jan 2002
TL;DR: A simple formal framework enables the specification of safety and progress properties and is based on Enhanced Characteristic Functions, which leads to simple definitions of operations such as hiding and various process compositions.
Abstract: We introduce a simple formal framework for specifying and implementing concurrent systems. The framework enables the specification of safety and progress properties and is based on Enhanced Characteristic Functions. The use of Enhanced Characteristic Functions leads to simple definitions of operations such as hiding and various process compositions. We discuss two compositions: the network composition for building networks of processes and the specification composition for building specifications of processes. A central notion in our framework is the notion of a snippet. A snippet represents a part behavior of a process satisfying one specific constraint. A specification of a concurrent process satisfying all constraints is expressed by means of a specification composition of snippets. We present various properties of the specification and network compositions that can be helpful in the specification and implementation of concurrent systems. We illustrate our design approach with the design of some asynchronous circuits.

16 citations

Journal ArticleDOI
TL;DR: Two infinite hierarchies of language families are obtained by limited fragmentation, the notions being analogous to those of ultralineanty and finiteness of index for context-free languages.
Abstract: The paper introduces a new class of L systems, where it is possible to continue derivations from certain specified subwords of the words obtained. Such L systems (called L systems with fragmentation or just JL systems) are of interest both from biological and formal language theory point of view. The paper deals with JL systems without interactions, discusses the basic properties of the language families obtained, as well as their position in the L hierarchy. Finally, two infinite hierarchies of language families are obtained by limited fragmentation, the notions being analogous to those of ultralineanty and finiteness of index for context-free languages.

16 citations

Book ChapterDOI
09 Mar 1983
TL;DR: This paper presents an overview of (a part of) the resul ts obtained for NLC grammars in the las t few years and considers var#ous extensions and var ia t ions of the basic model in order to obtain a general theory of graph Grammars based on the NLC model.
Abstract: In the las t years the theory of graph grammars has developed in to a chal lenging and mathematically in te res t ing area in computer science that is wel l -mot ivated by i t s many potent ia l f i e l ds of app l ica t ions, such as data bases, data f low analys is , concurrency, pattern recogni t ion and developmental biology (one can f ind more deta i l s in , e .g . , ~ER] and ~ I ) . Although there ex is ts already a considerable amount of l i t e rature on th is top ic , the mathematical theory of graph grammars is s t i i l much less developed than ti le theory of s t r ing grammars. In pa r t i cu la r there is a need for a un i fy ing framework for graph grammars w i th in which various issues can be discussed and compared, because in the ex is t ing theory one often encounters the undesirable s i tuat ion that various issues are invest igated w i th in various models, which makes i t d i f f i cu l t to compare the resu l ts . In ~R1] and~R2] NLC grammars were introduced as a f i r s t step towards such a un i fy ing framework. We would l i ke to bui ld up a sol id theory of NLC grammars f i r s t and then consider var#ous extensions and var ia t ions of the basic model in order to obtain a qui te general theory of graph grammars based on the NLC model. We hope that th is approach w i l l also y ie ld a better ins igh t in what are the central notions of the theory and what are the main problems to be solved yet . In th is paper we present an overview of (a part of) the resul ts obtained for NLC grammars in the las t few years. A more complete overview, together with proofs of the resul ts mentioned can be found in the Ph.D. thesis by D. Janssens (to appear).

16 citations

Journal ArticleDOI
TL;DR: It is proved that if K is a locally catenative DOL language, then Gv; K is bounded by a linear function.

15 citations

Journal ArticleDOI
TL;DR: The notion of a universal grammar is investigated in this framework, demonstrating the existence of selection universal grammars under weak conditions on the selection family.
Abstract: Selective substitution grammars first introduced by Rozenberg are further investigated In particular we study `context-free grammars' with selection, since the original model is too general in its generative power It is shown how the families of context-free, EOL and ETOL languages can be characterized by selective context-free grammars Further the effect of linguistic restrictions on the family of selection languages is investigated Finally, the notion of a universal grammar is investigated in this framework, demonstrating the existence of selection universal grammars under weak conditions on the selection family

15 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