Showing papers on "Petri net 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
TL;DR: This paper presents a conceptual framework to systematize concepts introduced in different PLCs specifically designed for safe (1-bounded) PN simulation and shows that there is no “optimum” schema.
45 citations
TL;DR: The overall organization and structure of dialogue and process control for a particular IIS is achieved using scripts, a modified version of augmented Petri nets {Zisman 77}, and the Taxis conceptual framework which stresses generalization abstraction.
Abstract: This paper deals with dialogue and process management for interactive information systems [abbrev. IISs) within the framework of Taxis Mylopoulos et al 80, a language for IIS design. Dialogues between a user and the system are represented through a small set of primitives incorporated into Taxis while process control is accomplished by incorporating Hoare's I/O commands for communicating sequential processes {Hoare 78}. The overall organization and structure of dialogue and process control for a particular IIS is achieved using scripts, a modified version of augmented Petri nets {Zisman 77}, and the Taxis conceptual framework which stresses generalization abstraction. A journal editing procedure is used to illustrate the proposed extension.
43 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
27 Sep 1982
TL;DR: Formal language theory is used to some extent in the investigation of properties of Petri nets and the language of a Petri net consists of the set of all firing sequences (or only of those firing sequences that lead to one of the finite number of final markings).
Abstract: Formal language theory is used to some extent in the investigation of properties of Petri nets (see, e.g. [H], [JV] and [P]). In most applications of language theory for Petri nets one considers completely sequentialized versions of Petri nets only. That is one assumes that a Petri net has one central run place which allows only a single transition to fire at a time; any sequence of such firings is called a firing sequence and the language of a Petri net consists of the set of all firing sequences (or only of those firing sequences that lead to one of the finite number of final markings).
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.
27 Sep 1982
TL;DR: In any theory of dynamic systems, the notion of invariance is of central importance and the supporting system is determined by what is invariable with respect to the processes.
Abstract: In any theory of dynamic systems, the notion of invariance is of central importance. Given a class of processes, the supporting system is determined by what is invariable with respect to the processes.
TL;DR: In this paper, Petri nets and Marked Graphs are used to model concurrent computations in the model of concurrent computation, and a Petri net is used to represent a graph.
Abstract: (1982). Petri Nets and Marked Graphs–Mathematical Models of Concurrent Computation. The American Mathematical Monthly: Vol. 89, No. 8, pp. 552-566.
TL;DR: A Petri net approach to enumerate all system success paths between a specified pair of nodes that requires only vector additions on a single matrix is presented.
27 Sep 1982
TL;DR: The substitution of a closed subnet by a B-equivalence one doesn’t change the properties (liveness, synchronic relations for transitions; markings for places) on the unmodified part of the net.
Abstract: In two previous papers, we introduced the notion of the B-equivalence (equivalence of behaviour) of two PT-nets on a common subset of transitions [Andre 80] and we pointed out the interest of the substitution theorem in PT-net analysis [Andre 81-2]. In short, the substitution of a closed subnet by a B-equivalent one doesn’t change the properties (liveness, synchronic relations for transitions; markings for places) on the unmodified part of the net.
04 Oct 1982
TL;DR: This paper aims to provide a solid formal foundation to the study of concurrency problems that arise within the area of graph grammars and think it is possible and fruitful to apply the concepts and techniques of net theory to these problems.
Abstract: Firstly, net theory, which is a well established theory of distributed systems and processes [I] relies heavily on a graphical notation. One of the strengths of this theory is that many of the fundamental notions concerning concurrent systems and in particular, the dynamics of a concurrent systemcan be made transparent with the help of simple net diagrams and transformations of such diagrams. It is important to provide a solid formal foundation to this aspect of net theory and graph grammars appear to be the obvious tool for doing so. The second motivation is that in the study of concurrency problems that arise within the area of graph grammars [2] we think it is possible and fruitful to apply the concepts and techniques of net theory.
TL;DR: There exists a 2-dimensional 6-state 9-neighbor deterministic asynchronous cell space (alternatively, a nondeterministic synchronous cell space) capable of simulating the safe behavior of any Petri net.
Abstract: There exists a 2-dimensional 6-state 9-neighbor deterministic asynchronous cell space (alternatively, a nondeterministic synchronous cell space) capable of simulating the safe behavior of any Petri net.
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.
Proceedings Article•
27 Sep 1982
TL;DR: An intuitively and mathematically simple and transparent calculus of invariant techniques, i.e., a powerful analysis technique, is presented and other models of nets with individual tokens, viz.
Abstract: In the well known model of Petri nets (place/transition-nets), actual system states are represented as distributions of “black” tokens onto the places of the nets. Such tokens can not be identified as individual objects. The introduction of individual objects as tokens increases considerably the descriptive power of nets and allows for small but efficient models of real systems.
07 Jun 1982
TL;DR: A global design methodology for large-scale real-time systems is introduced, based on such concepts as data-flow analysis, sequential processes, communication links, abstract architecture and two tools are introduced, having a specific action in the design process.
Abstract: We introduce a global design methodology for large-scale real-time systems; it is based on such concepts as data-flow analysis, sequential processes, communication links, abstract architecture. These concepts give us a guide for designing real-time systems; two tools are also introduced, having a specific action in the design process: OGIVE, a Petri net analyzer, makes the verification and the validation of the abstract structure; OSCAR, analytical queuing network, oriented, evaluates quantitatively some implementation choices of the real system. These tools are integrated very early in the design process to make us sure we shall not have dramatic regressions to do for, eventually, redesigning the system.
TL;DR: A PN representation of various nested blocks of the structured program is given and it is shown how each of the blocks can be simplified with a view to calculating the total execution time of a program.
27 Sep 1982
TL;DR: This paper discusses and compares various possible formalizations of the concept of “behavioral equivalence” and suggests that net theory and net languages play an important role in this study.
Abstract: Many complex systems involving concurrency are composed of two parts: a control structure and a data processing structure. This paper is concerned with the problem of specifying the input-output behavior of control structures. In particular, it discusses and compares various possible formalizations of the concept of “behavioral equivalence”. Net theory and net languages play an important role in this study.
27 Sep 1982
TL;DR: Petri nets have been proved to be a useful tool for the specification of parallelism in control systems and have been used for this purpose in several control systems.
Abstract: Petri nets have been proved to be a useful tool for the specification of parallelism in control 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.
27 Sep 1982
TL;DR: Twenty years have passed since the first publication on net theory and the author is grateful for the opportunity to speak on a topic of his choice.
Abstract: Twenty years have passed since the first publication on net theory. I am grateful for the opportunity to speak on a topic of my choice on this occasion.