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
Book
01 Jan 2007
TL;DR: The Handbook of Theoretical Computer Science as discussed by the authors provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field, including models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science.
Abstract: "Of all the books I have covered in the Forum to date, this set is the most unique and possibly the most useful to the SIGACT community, in support both of teaching and research.... The books can be used by anyone wanting simply to gain an understanding of one of these areas, or by someone desiring to be in research in a topic, or by instructors wishing to find timely information on a subject they are teaching outside their major areas of expertise." -- Rocky Ross, "SIGACT News" "This is a reference which has a place in every computer science library." -- Raymond Lauzzana, "Languages of Design" The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B takes up the theory of automata and rewriting systems, the foundations of modern programming languages, and logics for program specification and verification, and presents several studies on the theoretic modeling of advanced information processing. The two volumes contain thirty-seven chapters, with extensive chapter references and individual tables of contents for each chapter. There are 5,387 entry subject indexes that include notational symbols, and a list of contributors and affiliations in each volume.

14 citations

Proceedings Article
02 Dec 1986
TL;DR: This paper presents a formalism for actor systems in the framework of graph grammars, a model of massively parallel systems based on asynchronous message passing, that is motivated, motivated, and illustrated by examples.

14 citations

Journal Article
TL;DR: Formal Models, Synthesis of Reactive Systems: Application to Asynchronous Circuit Design, and Performance Analysis of Asynchronous Circuits Using Markov Chains.
Abstract: Formal Models- Composing Snippets- A Programming Approach to the Design of Asynchronous Logic Blocks- Asynchronous Circuits- GALA (Globally Asynchronous - Locally Arbitrary) Design- Synthesis of Reactive Systems: Application to Asynchronous Circuit Design- Decomposition in Asynchronous Circuit Design- Embedded System Design- Functional and Performance Modeling of Concurrency in VCC- Modeling and Designing Heterogeneous Systems- Timed Verification and Performance Analysis- Timed Verification of Asynchronous Circuits- Performance Analysis of Asynchronous Circuits Using Markov Chains

14 citations

Journal ArticleDOI
TL;DR: Some properties of the class of L languages with interactions are investigated and is found to be not closed under most of the usually considered operations on languages.

14 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