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 1991
TL;DR: The complexity of testing the equivalence of transition sequences and use of reentrant nets in modular analysis of colored nets are studied.
Abstract: Delays in synchronized elementary net systems.- Proving temporal properties of Petri nets.- The complexity of testing the equivalence of transition sequences.- Use of reentrant nets in modular analysis of colored nets.- On abstractions of nets.- Semantics, composition and net properties of algebraic high-level nets.- Top-down synthesis of live and bounded free choice nets.- Hood nets.- Distributable nets.- Computer supported design of kanban controlled production.- Optimal simulations, nets and reachability graphs.- An integrated software development methodology based on hierarchical colored Petri nets.- On net systems generated by process foldings.- On liveness preservation by composition of nets via a set of places.- Software implementation of petri nets and compilation of rule-based systems.- Bibliography of Petri nets 1990.

16 citations

Journal ArticleDOI
TL;DR: The results show that the more abstract-but essentially equivalent-model of elementary transition systems is the appropriate framework for theoretical studies concerning refinement operations for elementary net systems.
Abstract: Elementary transition systems are-in a strong categorical sense-the transition system version of a basic system model of net theory called elementary net systems. The structural notion of a region associated with elementary transition systems captures the intuitive idea of a local state as modelled by the conditions of an elementary net system. In this paper we equip elementary transition systems with a refinement operation over the local states (regions). We then show our operation satisfies a number of interesting properties. In particular, this operation supports compositional reasoning. It is very hard if not impossible to define a corresponding operation at the level of nets which enjoys similar properties. This is due to the concrete choice of conditions used to enforce intended behaviour. Thus our results show that the more abstract-but essentially equivalent-model of elementary transition systems is the appropriate framework for theoretical studies concerning refinement operations for elementary net systems.

16 citations

Book ChapterDOI
16 Sep 2001
TL;DR: This document considers access control mechanisms in the context of the team automata model and demonstrates the model usage and utility for capturing information security and protection structures, and critical coordinations between these structures.
Abstract: Team automata provide a framework for capturing notions like coordination, collaboration, and cooperation in distributed systems. They consist of an abstract specification of components of a system and allow one to describe different Interconnection mechanisms based upon the concept of "shared actions" This document considers access control mechanisms in the context of the team automata model. It demonstrates the model usage and utility for capturing information security and protection structures, and critical coordinations between these structures. On the basis of a spatial access metaphor, various known access control strategies are given a rigorous formal description in terms of synchronizations in team automata.

16 citations

Journal ArticleDOI
TL;DR: It is shown that each everywhere growing DIL language is the image under a coding of an everywhere growing (uniform)DOL language, which enable us to solve the subword complexity problems for developmental languages with interactions.
Abstract: Lee has shown that ifL is aDOL language, then πink(L)

16 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