Showing papers by "Grzegorz Rozenberg published in 1987"
01 Feb 1987
309 citations
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
01 Jan 1987
TL;DR: In this article, the authors consider two ways of recording the behavior of an elementary net system (EN system): via sequential observations and via non-sequential observations, and discuss each of the three approaches and then relate them to each other.
Abstract: We consider two ways of recording the behaviour of an elementary net system (EN system): via sequential observations and via non-sequential observations. In the sequential point of view each record of the behaviour of an EN system is a string of event occurrences (called a firing sequence) as registered by a sequential observer. In the nonsequential point of view we can define the behaviour of an EN system by either extracting causal order of events from firing sequences (obtaining firing traces) or by recording all nonsequential observations of event occurrences and of resulting holdings of conditions (each such record is called a process). In our contribution we discuss each of the three approaches and then relate them to each other.
71 citations
[...]
01 Jan 1987
TL;DR: This paper deals with one of the most important approaches used in the design of information systems, i.
Abstract: Many approaches are being developed for handling the different phases in the design of complex information systems, namely specification, verification, evaluation, implementation and testing. These approaches are more or less applicable to the various specific aspects of the design phases and partially supported by efficient tools. This paper deals with one of the most important approaches used in the design of information systems, i. e., the Petri net based models approach, which proves particularly interesting. It is indicated how Petri net based models are used to represent systems behavior and then some of the resulting advantages are given. Furthermore, it is emphasized why and how a Petri net based approach can support all the design phases and it is made clear for which purposes and in which applications Petri net based designs are important. are also given. A few illustrative examples
60 citations
01 Jan 1987
TL;DR: The GAMERU model, a language for the analysis and design of human communication pragmatics within organizational systems, and parallel systems specifications with coloured Petri nets and algebraic specifications are presented.
Abstract: Specification and properties of a cache coherence protocol model.- GAMERU: A language for the analysis and design of human communication pragmatics within organizational systems.- Recent results on the complexity of problems related to Petri nets.- Algebraic structure of flows of a regular coloured net.- On equivalent execution semantics of concurrent systems.- Mathematical methods for calculating invariants in Petri nets.- On Petri nets with deterministic and exponentially distributed firing times.- An accurate performance model of CSMA/CD bus LAN.- Petri net models for the ?-calculus.- Fair processes.- Operational Petri net semantics for CCSP.- Infinitary languages of Petri nets and logical sentences.- A strong part of concurrency.- Concurrency and continuity.- Parallel systems specifications with coloured Petri nets and algebraic specifications.- Bibliography of Petri nets.
55 citations
01 Jan 1987
32 citations
TL;DR: A new graph invariant, the so-called index of a graph which seems to be very suitable for describing the adjacency structure of a graphs, is introduced and it is proved that every BNLC language is of bounded index.
29 citations
Book•
01 Jan 1987
TL;DR: This chapter discusses computer tools for construction, modification and analysis of Petri nets, and "Forgotten topics" of net theory.
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.
18 citations
Book•
01 Jan 1987
TL;DR: This chapter discusses elementary net systems, place/Transition Systems, and other Petri Net Models and their foundations.
Abstract: Contents: Introduction to Part I- Prologue- Elementary Net Systems - Fundamentals- Place/Transition Systems - Fundamentals- High-Level Nets - Fundamentals- Special Topics- Other Petri Net Models- Addresses of the authors
10 citations
TL;DR: This paper examines the generating power of a simple extension of the well studied node-label controlled graph grammars, and shows that the extension, called handle NLC grammARS, gives the ability to generate any recursively enumerable graph language.
01 Oct 1987
TL;DR: Dependence graphs (which are special kinds of acyclic directed node labeled graphs) are very fundamental objects in the Theory of traces approach to concurrent systems and in the theory of graph grammars.
Abstract: Dependence graphs (which are special kinds of acyclic directed node labeled graphs) are very fundamental objects in the theory of traces approach to concurrent systems and in the theory of graph grammars.