Showing papers on "Process architecture published in 1983"
TL;DR: Conditions under which a subnet can be substituted for a single transition while preserving properties such as liveness and boundedness are presented.
309 citations
29 Aug 1983
TL;DR: Graph models have been proposed by many authors as a useful tool for the analysis of peculiar features of computer systems such as concurrency, synchronization, communication, and cooperation among subsystems.
Abstract: Graph models have been proposed by many authors as a useful tool for the analysis of peculiar features of computer systems such as concurrency, synchronization, communication, and cooperation among subsystems. Much of the work in this field is related to the original ideas developed by C. A. Petri. These graph models are today generally known as Petri Nets (PNs).
159 citations
01 Dec 1983
TL;DR: It is shown that, under some structural assumptions, timed Petri net models of manufacturing processes translate into linear equations in a (max, +)- based algebra, which can solve these equations for the purposes of both performance evaluation and real-time control.
Abstract: A preliminary investigation, and extension of the power, of timed Petri nets to describe, model, and analyze production processes is reported. In particular, insights into real-time control aspects as well as the performance of flexible manufacturing systems are sought. Comparisons with previous investigative models are made. New and general modeling conventions are provided, which extend the realm of Petri net modeling capabilities. Various realistic aspects of manufacturing processes are modeled. Efficient algebraic tools to analyze a certain class of Petri nets are described [1]. We show that, under some structural assumptions, timed Petri net models of manufacturing processes translate into linear equations in a (max, +)- based algebra. Efficient algorithms can solve these equations for the purposes of both performance evaluation and real-time control.
141 citations
01 Jan 1983
TL;DR: It is shown how Petri nets can be generalized to allow processes to be described by a common subnet, without losing the ability to distinguish between them.
Abstract: In many systems a number of different processes have a similar structure and behaviour. To shorten system description and system analysis it is desirable to be able to treat such similar processes in a uniform and succinct way. In this paper it is shown how Petri nets can be generalized to allow processes to be described by a common subnet, without losing the ability to distinguish between them. Our generalization, called coloured Petri nets, is heavily influenced by predicate/transition-nets introduced by H.J. Genrich and K. Lautenbach. Moreover our paper shows how the invariant-method, introduced for Petri nets by K. Lautenbach can be generalized to coloured Petri nets. Revised version (first version 1979)
22 citations
01 Jan 1983
TL;DR: It is proved that CCS defines a subclass of the concurrent systems definable by means of net theory, i.e. the class of systems composed of interacting sequential automata, to transfer analytic concepts and techniques from a theory to the other, as for example the observation equivalence notion defined inside the CCS.
Abstract: The comparison between Milner’s CCS and Petri nets leads to prove that CCS defines a subclass of the concurrent systems definable by means of net theory, i.e. the class of systems composed of interacting sequential automata. The proof is based on (the construction of) an isomorphism between Milner’s communicating systems class and a subclass of Petri nets.The paper fully presents the proof for a subclass of communicating systems (where neither value passing nor finite unlimited instances of agents are allowed) and a specific subclass of nets, the SA2 PT class (a restriction of the Superposed Automata nets class). Some hints how to extend the proof to the whole CCS conclude the paper. This result allows to transfer analytic concepts and techniques from a theory to the other, as for example the observation equivalence notion defined inside the CCS. The paper is fully self-consistent.
21 citations
TL;DR: A model of the fuzzy Petri net, which is derived by fuzzification of transitions and places from the classical PetriNet, is proposed, which results from intuitions and experiences of specialists.
14 citations
13 citations
TL;DR: A Petri Net based design method which supports the initial phases of the software development process and allows for the systematic specification and analysis of system requirements and software requirements.
Abstract: We present a Petri Net based design method which supports the initial phases of the software development process. This method allows for the systematic specification and analysis of system requirements and software requirements.
12 citations
Book•
01 Jan 1983
TL;DR: A graph theoretical property for minimal deadlocks in Petri nets and the notion of interface in condition/event-systems and Behavioral equivalence of concurrent systems are discussed.
Abstract: Invited address.- Some personal views of net theory.- List of contributions.- Structural transformations giving B-equivalent PT-nets.- Equivalence notions for concurrent systems.- Milner's communicating systems and Petri nets.- A matrix-based implementation of generalized Petri nets.- Petri nets specification of virtual ring protocols.- A note on D-continuous causal nets.- S-invariance in predicate/transition nets.- A diagram editor for line drawings with inscriptions.- Formal semantics by a combination of denotational semantics and high-level Petri nets.- Notions of computability by Petri nets.- High-level Petri nets.- Specification and verification of networks in a Petri net based language.- Construction of distributed systems from cycle-free finite automata.- A graph theoretical property for minimal deadlocks.- Petri nets with individual tokens.- Subset languages of Petri nets.- Control of flexible production systems and Petri nets.- On the notion of interface in condition/event-systems.- Behavioral equivalence of concurrent systems.- Program of the workshop.- Addresses of contributors.
TL;DR: A technique exploiting the reachability concept of Petri nets is used to enumerate the 2-trees of a graph using only vector additions on a single matrix, which alleviates the computational efforts.
01 Dec 1983
TL;DR: The proposed technique exploiting the modern concepts of Petri nets for simplification of Boolean functions does not require the functions to be expressed explicitly in a canonical form and alleviates the computational efforts.
TL;DR: This paper cannot describe all aspects of Petri nets and latter spinoffs in detail, but is intended to give a general overview of their functionality and uses.
Abstract: Petri nets are a flowcharting technique used to model asynchronous and concurrent processes. There have been many articles written on them and various other modifications of the Petri net language. This paper cannot describe all aspects of Petri nets and latter spinoffs in detail, but is intended to give a general overview of their functionality and uses.
TL;DR: Extended Petri nets are used to model the flow of messages and data during protection enforcement within MULTISAFE, a multimodule system architecture for secure database management.
TL;DR: The concept of Super-Net, which subsumes various extensions of Petri nets, is introduced, and languages associated with both non-labeled as well as labeled Super-Nets are considered, and this hierarchy is applied to show that Petri net languages are not closed under Kleene star.
TL;DR: It is shown that a slight and reasonable strengthening of the simulation rules defined in [1] enables us to answer the raised question in the positive, whether PNlog-nets allow to solve synchronization problems not solvable by ordinary Petri nets under certain simulation rules.
Abstract: In this article we pick up a problem stated in [1], namely the question whether PNlog-nets allow to solve synchronization problems not solvable by ordinary Petri nets under certain simulation rules We show that a slight and reasonable strengthening of the simulation rules defined in [1] enables us to answer the raised question in the positive As will be pointed out in the introduction, with this result we “partially” solve the original problem