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 ChapterDOI
01 Jan 1992
TL;DR: This paper surveys various notions of equivalence for concurrent systems in the framework of Elementary Net Systems, a fundamental class in the family of Petri Net models.
Abstract: This paper surveys various notions of equivalence for concurrent systems in the framework of Elementary Net Systems, a fundamental class in the family of Petri Net models. Two types of equivalences are considered: equivalences based on observations of actions defined in the framework of interleaving, step and partial order semantics; and equivalences based on state spaces and state observability.

142 citations

Book
01 Feb 1997

140 citations

BookDOI
01 Jan 1987
TL;DR: In this paper, Petri net based models in the specification and verification of protocols have been used to construct Petri nets in software engineering and to model architectural features with petrinets.
Abstract: to Part II.- Computer tools for construction, modification and analysis of Petri nets.- Petri net tool overview 1986.- Petri nets in software engineering.- Nets in data bases.- Petri net based models in the specification and verification of protocols.- Human-machine interaction and role/function/action-nets.- Nets in production systems.- Nets in computer organization.- Nets in office automation.- Modelling architectural features with petrinets.- Trace theory.- Event structures.- CCS - and its relationship to net theory.- COSY: Its relation to nets and to CSP.- TCSP: Theory of communicating sequential processes.- Reduction, data flow and control flow models of computation.- "Forgotten topics" of net theory.

134 citations

BookDOI
01 May 2001
TL;DR: In this paper, the CO-OPN/2 formalism is used to specify a Petri Net with high-level Petri Nets for the specification of a groupware editing tool.
Abstract: Section I.- Object Oriented Modelling with Object Petri Nets.- Using Petri Nets for Specifying Active Objects and Generative Communication.- Object-Oriented Nets with Algebraic Specifications: The CO-OPN/2 Formalism.- CLOWN as a Testbed for Concurrent Object-Oriented Concepts.- Concurrency in Communicating Object Petri Nets.- Object Orientation in Hierarchical Predicate Transition Nets.- CoOperative Objects: Principles, Use and Implementation.- OB(PN)2: An Object Based Petri Net Programming Notation.- On Formalizing UML with High-Level Petri Nets.- Section II.- Modeling a Groupware Editing Tool with Cooperative Objects.- Modelling Constrained Geometric Objects with OBJSA Nets.- An Object-Based Modular CPN Approach: Its Application to the Specification of a Cooperative Editing Environment.- KRON: Knowledge Engineering Approach Based on the Integration of CPNs with Objects.- Modeling of a Library with THORNs.- Inheritance of Dynamic Behavior Development of a Groupware Editor.- Object Coloured Petri Nets - A Formal Technique for Object Oriented Modelling.- Section III.- An Actor Algebra for Specifying Distributed Systems: The Hurried Philosophers Case Study.- Formal Reasoning about Actor Programs Using Temporal Logic.- Flexible Types for a Concurrent Model.- High Level Transition Systems for Communicating Agents.- Schedulability Analysis of Real Time Actor Systems Using Coloured Petri Nets.- Control Properties in Object-Oriented Specifications.- Case Studies.- A Cooperative Petri Net Editor.- The Hurried Philosophers.

127 citations

Book
04 Nov 1974
TL;DR: The fundamental L families constitute a similar testing ground as the Chomsky hierarchy when new devices (grammars, automata, etc.) and new phenomena are investigated in language theory.
Abstract: L systems are parallel rewriting systems which were originally introduced in 1968 to model the development of multicellular organisms, [L1]. The basic ideas gave rise to an abundance of language-theoretic problems, both mathematically challenging and interesting from the point of view of diverse applications. After an exceptionally vigorous initial research period (roughly up to 1975; in the book [RSed2], published in 1985, the period up to 1975 is referred to, [RS2], as \when L was young"), some of the resulting language families, notably the families of D0L, 0L, DT0L, E0L and ET0L languages, had emerged as fundamental ones in the parallel or L hierarchy. Indeed, nowadays the fundamental L families constitute a similar testing ground as the Chomsky hierarchy when new devices (grammars, automata, etc.) and new phenomena are investigated in language theory. L systems were introduced by Aristid Lindenmayer in 1968, [L1]. The original purpose was to model the development of simple lamentous organisms. The development happens in parallel everywhere in the organism. Therefore, parallelism is a built-in characteristic of L-systems. This means, from the point of view of rewriting, that everything has to be rewritten at each step of the rewriting process. This is to be contrasted to the \sequential" rewriting of phrase structure grammars: only a speci c part of the word under scan is rewritten at each step. Of course, the e ect of parallelism can be reached by several se-

126 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