Showing papers on "Process architecture published in 1982"
1,252 citations
TL;DR: An isomorphism between the behavior of Petri nets with exponentially distributed transition rates and Markov processes is presented and this work solves for the steady state average message delay and throughput on a communication link when the alternating bit protocol is used for error recovery.
Abstract: An isomorphism between the behavior of Petri nets with exponentially distributed transition rates and Markov processes is presented. In particular, k-bounded Petri nets are isomorphic to finite Markov processes and can be solved by standard techniques if k is not too large. As a practical example, we solve for the steady state average message delay and throughput on a communication link when the alternating bit protocol is used for error recovery.
1,090 citations
27 Sep 1982
TL;DR: This paper combines two closely related net models, predicate/transition nets and coloured Petri nets, into a new net model called high-level Petrinets, intended to combine the qualities of the two old models into a single formalism.
Abstract: This paper combines two closely related net models, predicate/transition nets and coloured Petri nets, into a new net model called high-level Petri nets. The new model is intended to combine the qualities of the two old models into a single formalism, and we propose in future to use high-level Petri nets instead of both predicate/transition nets and coloured Petri nets.
288 citations
17 May 1982
183 citations
TL;DR: The most important classes of nets are presented, their analysis possibilities are given and it is shown how they can be used to model and analyze communication and cooperation protocols.
114 citations
TL;DR: In this paper, a model of the connection and disconnection phases is developed, and properties of correctness are demonstrated, using Petri net theory results, namely, reductions and linear invariants techniques.
Abstract: After a brief introduction to the theory of Petri nets, the ECMA transport protocol is presented. Then a model of the connection and disconnection phases is developed. Properties of correctness are demonstrated, using Petri net theory results, namely, reductions and linear invariants techniques. Predicate/transition nets are introduced and the underlying network service is modeled. Then a model of the data transfer phase is described. It allows correction of the errors signaled by the network level, by using a window mechanism and control frames for acknowledgments and rejections. The correctness of the data transfer is demonstrated using invariants. The service provided to the upper level is thus validated.
110 citations
27 Sep 1982
TL;DR: Low production cost requirements have developped a new trend to flexible production system automatization during these last years, where controllers are no longer isolated on a production machine, they are progressively interconnected with a transportation system and merged into an information system.
Abstract: Low production cost requirements have developped a new trend to flexible production system automatization during these last years. Controllers are no longer isolated on a production machine, they are progressively interconnected with a transportation system and merged into an information system.
43 citations
TL;DR: A new computation system formulation is introduced and general notions of homomorphisms and isomorphisms between computation systems are developed that show that vector replacement systems can be simulated by vector addition systems, and that generalized Petri nets can be emulated by Petrinets.
30 citations
TL;DR: Petri nets can be viewed as formal automata or as an automation which can generate the formal languages or a model to analyse and synthesize various kinds of systems.
Dissertation•
01 Jan 1982
TL;DR: A class of Petri nets is recursively defined starting with simple, live and safe structures, becoming progressively more complex using net transformations designed to preserve liveness and safeness, and their effect on Petri net behavior is considered.
Abstract: Liveness and safeness are two key properties Petri nets should have when they are used to model asynchronous systems. The analysis of liveness and safeness for general Petri nets, though shown to be decidable by Mayr [1981], is still computationally expensive (Lipton [1976]). In this paper an hierarchical approach is taken: a class of Petri nets is recursively defined starting with simple, live and safe structures, becoming progressively more complex using net transformations designed to preserve liveness and safeness. Using simple net transformations, nice nets, which are live and safe, are defined. Their behavior is too restrictive for modeling non-trivial systems, so the mutual exclusion and the repetition constructs are added to get µ-ρ-nets. Since the use of mutual exclusions can cause deadlock, and the use of repetitions can cause loss of safeness, restrictions for their use are given. Using µ-ρ-nets as the building blocks, hierarchical nets are defined. When the mutual exclusion and repetition constructs are allowed between hierarchical nets, distributed hierarchical nets are obtained. Examples of distributed hierarchical nets used to solve synchronization problems
are given. General net transformations not preserving liveness or safeness, and a notion of duality are presented, and their effect on Petri net behavior is considered.
TL;DR: A Computer Aided Design system for modelling and analysis by validation of Concurrent Logic Control Systems, using Petri nets to simplify the description of theses systems and a special description language is proposed.
27 Sep 1982
TL;DR: This work proposes to combine the two models of denotational semantics and Petri nets into a single approach, where denotations is used to build up environments and to describe store transformations, while Petrinets are used to describe sequencing and communication.
Abstract: The purpose of the paper is to introduce a semantic model based on a combination of denotational semantics [Gordon] and high-level Petri nets [Genrich, Lautenbach], [Jensen]. The basic idea behind our approach is due to Kurt Jensen.
27 Sep 1982
TL;DR: This presentation explains the design of reliable and fault tolerent networks and some examples show how such mechanisms are difficult to build due to the asynchronous failures detections at each implied site.
Abstract: Distributed processing requires the design of reliable and fault tolerent networks. Such mechanisms are difficult to build due to the asynchronous failures detections (sites crashes, logical or physical partings) at each implied site.
Book•
01 Jun 1982
TL;DR: Petri Net Modelling and Reliability of Distributed Algorithms, and Treatment of Recovery Problems Using Cuts in Occurence Nets are discussed.
Abstract: One: First European Workshop On Application And Theory Of Petri Nets - Strasbourg -.- Application of Nets to Real-Time Systems.- Overview.- Petri Net Modelling and Reliability of Distributed Algorithms.- Using Petri Nets in Measurements of a Distributed Data Base System.- On the Problem of Time in Nets.- Programming Languages and Software Engineering.- Overview.- Transforming Nets Along the Syntactic Production of Programs.- Design-Review by Petri-Nets.- Concurrency in Functional Descriptions.- RNL - A Language for Digital Systems Design Based on Nets.- Galileo: A Methodology for Modelling and Designing Real Time Systems.- Petri Nets and Semantics of System Descriptions.- Information Flow and Concurrency.- Overview.- The Relationship Between Time and Information.- Information Flow in Nets.- An Exercise in Processes with Infinite Pasts.- Two Alternative Definitions of Synchronic Distance.- On the Construction of System Nets.- Net Morphisms and Higher Level Net Interpretations.- Overview.- Net Morphisms and Software Engineering.- An Equivalence-Notion for Condition/Event - Systems.- Recursive Nets.- Behaviour of a Place - Transition Net on a Subset of Transitions.- Stepwise Refinements of Transitions and Places.- Transfer of graph constructs in Goguen's paper to net constructs.- Structural modifications in Net Theory.- Mathematical Analysis and Net Languages.- Overview.- Iterative Methods for the Analysis of Petri Nets.- Inductive Assertions for Analyzing Reachability Sets.- Leakage Notion.- Graph-Theoretical Analysis of a Subclass of Petri Nets.- Synthesis of Concurrent Systems.- Subclasses of Self-Modifying Nets.- Test On Zero in Petri Nets.- Deterministic Languages of Petri Nets.- A Study of the Projection Operation.- Reliability and Recovery Issues.- Overview.- Petri-Net Implementation of Recovery Strategies in a large ESS.- Petri Nets and Reliable Real Time Systems.- Towards Fault Tolerant Real Time Systems by Using Petri Nets.- Treatment of Recovery Problems Using Cuts in Occurence Nets.- Two: Second European Workshop on Application and Theory of Petri Nets - Bad Honnef -.- Use of the Behaviour Equivalence in Place-Transition Net Analysis.- Modeling and Proofs of a Data Transfer Protocol by Predicate/ Transition Nets.- On the Logic of Concurrency and Conflict.- Superposed Automata Nets.- Evaluation Based upon Stochastic Petri Nets of the Maximum Throughput of a Full Duplex Protocol.- Weighted Synchronic Distances.- A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net.- Constructive Proofs as Programs Executable by PrT Nets.- Correctness Proof for the Alternating Bit Protocol by Assertion Systems.- A Fair Competition Between Two or More Partners.
Proceedings Article•
01 Jan 1982
27 Sep 1982
TL;DR: Eleven different definitions for functions to be computable by Petri nets are given and compared and it was possible to show that they are not powerful enough to describe all the primitive recursive functions.
Abstract: Eleven different definitions for functions to be computable by Petri nets are given and compared. For nine of these definitions it was possible to show that they are not powerful enough to describe all the primitive recursive functions.