scispace - formally typeset
Search or ask a question

Showing papers on "Petri net published in 1993"


Kurt Jensen1
04 Jun 1993
TL;DR: Colored Petri nets (CPN) as discussed by the authors is a formalism which extends ordinary Petri net by adding data types and modularity, which makes it possible to make succinct, readable and structured models.
Abstract: Coloured Petri nets (CPN) is a formalism which extends ordinary Petri nets by adding data types and modularity. This means that is possible to make succinct, readable and structured models. The CPN models may be investigated by means of simulation. However, the models may also be validated by a number of mathematical analysis techniques, such as state graphs and invariants. The modelling, simulation and analysis by means of CPN are supported by a set of commercially available computer tools called Design/CPN. CPN models have been used in a large range of different application areas, some of which are listed. Design/CPN uses the functional programming language Standard ML to specify data types, functions and data manipulations. 12 properties of CPN are presented. >

516 citations


Journal ArticleDOI
TL;DR: It turns out that SWN's allow the representation of any color function in a structured form, so that any unconstrained high-level net can be transformed into a well-formed net.
Abstract: The class of stochastic well-formed colored nets (SWN's) was defined as a syntactic restriction of stochastic high-level nets. The interest of the introduction of restrictions in the model definition is the possibility of exploiting the symbolic reachability graph (SRG) to reduce the complexity of Markovian performance evaluation with respect to classical Petri net techniques. It turns out that SWN's allow the representation of any color function in a structured form, so that any unconstrained high-level net can be transformed into a well-formed net. Moreover, most constructs useful for the modeling of distributed computer systems and architectures directly match the "well-formed" restriction, without any need of transformation. A nontrivial example of the usefulness of the technique in the performance modeling and evaluation of multiprocessor architectures is included. >

340 citations


Book
30 Sep 1993
TL;DR: This work introduces Petri nets, a model for manufacturing information systems, and some net subclasses and their analysis, as well as hybrid synthesis: combining top-down and bottom-up methods.
Abstract: Introduction. 1: Introducing Petri nets M. Silva. Nets and net systems. On modelling features. On net systems interpretations. Approaching concurrency qualitative problems. Qualitative analysis of net system models. Some net subclasses and their analysis. Concluding remarks. 3: Principles of system modelling J.M. Proth. Manufacturing system modelling: basic concepts. Transportation system between two points on a shop-floor. Storage facilities. Operation modelling. Tool systems. Material-handling systems. Conclusion. 3: Synthesis for manufacturing systems integration F. DiCesare, Mu Der Jeng. Introduction to Synthesis. Bottom-up synthesis. Top-down methods. Hybrid synthesis: combining top-down and bottom-up. Summary. 4: Performance evaluation of manufacturing systems J.M. Proth. Introduction. Event graphs: definition and properties. Manufacturing systems working on a cyclic basis. The general case. 5: Petri nets for manufacturing information systems G. Harhalakis, F.B. Vernadat. Introduction. Basics of manufacturing information systems. High-level Petri nets. Organization analysis and conceptual database design. Modeling, analysis and implementation of company policies. Conclusions. Index.

337 citations


Proceedings Article
01 Jul 1993
TL;DR: The theory of Petri nets is introduced as a tool for computer-implementable representation of pathways to overcome the present limitations and enable the preliminary qualitative analysis of pathways.
Abstract: The present methods for representing metabolic pathways are limited in their ability to handle complex systems, incorporate new information, and to provide for drawing qualitative conclusions from the structure of pathways. The theory of Pctri nets is introduced as a tool for cornputer-implementable representation of pathways. Petri nets have the potential to overcome the present limitations, and through a multitude of properties, enable the preliminary qualitative analysis of pathways.

325 citations


Journal ArticleDOI
TL;DR: The class of Petri nets obtained by eliminating timing from generalized stochastic Petri net (GSPN) models while preserving the qualitative behavior is identified and it is shown that for a (wide) class of nets, the definition of firing probabilities of conflicting immediate transitions does not require the information on reachable markings.
Abstract: The class of Petri nets obtained by eliminating timing from generalized stochastic Petri net (GSPN) models while preserving the qualitative behavior is identified. Structural results for those nets are derived, obtaining the first structural analysis of Petri nets with priority and inhibitor arcs. A revision of the GSPN definition based on the structural properties of the models is presented. It is shown that for a (wide) class of nets, the definition of firing probabilities of conflicting immediate transitions does not require the information on reachable markings. Identification of the class of models for which the net-level specification is possible is also based on the structural analysis results. The procedure for the model specification is illustrated by means of an example. It is also shown that a net-level specification of the model associated with efficient structural analysis techniques can have a substantial impact on model analysis. >

255 citations


Book ChapterDOI
21 Jun 1993
TL;DR: This paper presents a formal (and also an informal) definition of ICN, a tool for modeling office workflow, and illustrates the utility of ICNs via an office analysis example.
Abstract: Petri net models and variants thereof have primarily been used to model structured systems such as computer programs, factory production lines, and engineering hardware. In contrast, this paper discusses the issues and challenges in the modeling of human activity in the workplace. This type of activity frequently has a large component that is unstructured, creative work. It is dynamic and difficult to capture via traditional Petri nets. Our research group at the University of Colorado has been investigating Information Control Nets (ICNs), derived from high level Petri nets, as a tool for modeling office workflow. After carefully explaining the notion of Workflow, this paper presents a formal (and also an informal) definition of ICN. We illustrate the utility of ICNs via an office analysis example.

239 citations


Book ChapterDOI
21 Jun 1993
TL;DR: The Interval Timed Colored Petri Net (ITCPN) model as mentioned in this paper is a coloured Petri net extended with time, where time is in tokens and transitions determine a delay for each produced token.
Abstract: Practical experiences show that only timed and coloured Petri nets are capable of modelling large and complex real-time systems. This is the reason we present the Interval Timed Coloured Petri Net (ITCPN) model. An interval timed coloured Petri net is a coloured Petri net extended with time; time is in tokens and transitions determine a delay for each produced token. This delay is specified by an upper and lower bound, i.e. an interval. The ITCPN model allows the modelling of the dynamic behaviour of large and complex systems, without losing the possibility of formal analysis. In addition to the existing analysis techniques for coloured Petri nets, we propose a new analysis method to analyse the temporal behaviour of the net. This method constructs a reduced reachability graph and exploits the fact that delays are described by an interval.

195 citations


Proceedings ArticleDOI
19 Oct 1993
TL;DR: It is shown that efficient analysis techniques from PetriNet theory can be exploited for analysis of QPNs, thus supporting the general objective of combining Petri net and queueing network formalisms.
Abstract: System analysis is often needed with respect to both qualitative and quantitative aspects. In recent decades, several formalisms have been developed that attempt to combine these aspects in one description. Present emphasis is on stochastic Petri nets. One disadvantage of these formalisms is the difficulties when describing scheduling strategies with Petri net elements. A new version of queuing Petri nets (QPNs), which combines queuing networks and Petri nets, aiming at eliminating these disadvantages is described. The new version also exhibits the modeling of timed transitions and timeless queues for describing pure scheduling mechanisms. QPNs are a superset of queueing networks and (generalized stochastic) Petri nets. The analysis of QPNs is discussed, and it is shown that efficient analysis techniques from Petri net theory can be exploited for analysis of QPNs, thus supporting the general objective of combining Petri net and queueing network formalisms. >

170 citations


Book ChapterDOI
01 Jan 1993
TL;DR: The quantitative analysis concerns the evaluation of the efficiency of the modeled system, and looks for performance properties (e.g. throughput, responsiveness, or utilization rates) in the context of modern manufacturing systems.
Abstract: Modern manufacturing systems are highly parallel and distributed. They need to be analyzed from qualitative and quantitative points of view. Qualitative analysis looks for properties like the absence of deadlocks, the absence of (store) overflows, or the presence of certain mutual exclusions in the use of shared resources (e.g. a robot). Its ultimate goal is to prove the correctness of the modeled system. Quantitative analysis looks for performance properties (e.g. throughput), responsiveness properties (e.g. average completion times) or utilization properties (e.g. average queue lengths or utilization rates). In other words, the quantitative analysis concerns the evaluation of the efficiency of the modeled system.

157 citations


Journal ArticleDOI
Kurt Jensen1
01 Mar 1993
TL;DR: This paper describes how Coloured Petri Nets have been developed - from being a promising theoretical model to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems.
Abstract: This paper describes how Coloured Petri Nets (CP-nets) have been developed - from being a promising theoretical model to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems (and other systems in which human beings and/or computers communicate by means of some more or less formal rules). First CP-nets are introduced by means of a small example and a formal definition of their structure and behaviour is presented. Then we describe how to extend CP-nets by a set of hierarchy constructs (allowing a hierarchical CP-net to consist of many different subnets, which are related to each other in a formal way). Next we describe how to analyse CP-nets, how to support them by various computer tools, and we also describe some typical applications. Finally, a number of future extensions are discussed (of the net model and the supporting software).

155 citations


Book ChapterDOI
21 Jun 1993
TL;DR: A new class of stochastic Petri nets in which one or more places can hold fluid rather than discrete tokens is introduced, and equations for their transient and steady-state behavior are provided.
Abstract: In this paper we introduce a new class of stochastic Petri nets in which one or more places can hold fluid rather than discrete tokens. After defining the class of fluid stochastic Petri nets, we provide equations for their transient and steady-state behavior. We give two application examples. We hope that this paper will spur further research on this topic.

Book ChapterDOI
21 Jun 1993
TL;DR: This paper shows how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives—place capacities, test arcs and inhibitor arcs to improve the possibilities of creating models that are on the one hand compact and comprehensive and on the other hand easy to develop, understand and analyse.
Abstract: In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives—place capacities, test arcs and inhibitor arcs. The new modelling primitives are introduced to improve the possibilities of creating models that are on the one hand compact and comprehensive and on the other hand easy to develop, understand and analyse. A number of different place capacity and inhibitor concepts have been suggested earlier, e.g., integer and multi-set capacities and zero-testing and threshold inhibitors. These concepts can all be described as special cases of the more general place capacity and inhibitor concepts defined in this paper.

Book ChapterDOI
Kurt Jensen1
01 Jun 1993
TL;DR: In this article, the basic theoretical aspects of Coloured Petri Nets (CP-nets or CPN) are presented, from a promising theoretical model, to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems.
Abstract: This paper presents the basic theoretical aspects of Coloured Petri Nets (CP-nets or CPN). CP-nets have been developed, from being a promising theoretical model, to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems (and other systems in which human beings and/or computers communicate by means of some more or less formal rules). The paper contains the formal definition of CP-nets and their basic concepts (e.g., the different dynamic properties such as liveness and fairness). The paper also contains a short introduction to the analysis methods, in particular occurrence graphs and place invariants.

Book
01 Jan 1993
TL;DR: This work presents a generalized methodology for evaluating manufacturability and a knowledge-based approach to design for manufacture using features, which aims to address organizational issues in concurrent engineering and the application of expert systems to engineering design.
Abstract: Organizational issues in concurrent engineering. Principles of concurrent engineering. Concurrent engineering's roots in the World War II era. Implementation: common failure modes and success factors. Overcoming barriers to the implementation of concurrent engineering. Improving interpersonal communications on multifunctional teams. Scheduling of concurrent manufacturing projects. Tools and techniques of concurrent engineering. Models of design processes. A decision-based approach to concurrent design. Concurrent optimization of product design and manufacture. Computer-based concurrent engineering systems. Multi-attribute design optimization and concurrent engineering. Concurrent cell design and cell control system configuration. A generalized methodology for evaluating manufacturability. Evaluating product machinability for concurrent engineering. Concurrent optimization of design and manufacturing tolerances. Design for human factors. Cost considerations in concurrent engineering. Designing to cost. Economic design in concurrent engineering. Artificial intelligence in concurrent engineering. Application of expert systems to engineering design. A knowledge-based approach to design for manufacture using features. Concurrent accumulation of knowledge: a view of concurrent engineering. Integrated knowledge systems for adaptive, concurrent design. Automating design for manufacturability through expert system approaches. Modelling the design process with petri nets. Neuro-computing and concurrent engineering.

Journal ArticleDOI
01 Jan 1993
TL;DR: Research results in both bottom-up and top-down synthesis techniques for Petri net modeling are reviewed and their relationship to synthesis methods are discussed.
Abstract: Research results in both bottom-up and top-down synthesis techniques for Petri net modeling are reviewed. These methods can be adopted for representing parallel and distributed application environments such as automated manufacturing systems. Bottom-up techniques, consisting of the merging of places and sharing of simple elementary paths, have the advantage of ease of system description since the modeled subsystems usually have real-life correspondences. Nevertheless, with current bottom-up techniques, the synthesized system may not exhibit the same control properties as the subsystems. Top-down methods, including refinement of transitions and refinement of places, have the advantage of viewing the system globally, which may generate more structured designs. However, it is difficult to apply these methods to the environments with highly shared resources. Examples in the context of automated manufacturing systems are given to demonstrate application of these techniques. Petri net reduction techniques and their relationship to synthesis methods are discussed. >

Book ChapterDOI
21 Jun 1993
TL;DR: Based on this class of timed nets with timing of arcs directing from places to transitions, the corresponding state graph, called dynamic graph, and a method to compute the state graph are defined.
Abstract: The paper presents an analysis method for Place/Transition nets with timing of arcs directing from places to transitions. Based on this class of timed nets, the corresponding state graph, called dynamic graph, and a method to compute the state graph are defined.

Journal ArticleDOI
01 Mar 1993
TL;DR: The modeling and analysis of a flexible manufacturing system (FMS) cell using Petri nets is presented and theAnalysis of a timed Petri net for cycle time is presented.
Abstract: The modeling and analysis of a flexible manufacturing system (FMS) cell using Petri nets is presented. In order to illustrate how a Petri net with desirable properties can be constructed, the detailed synthesis process for this cell is described. During the process, top-down refinement, system decomposition, and modular composition ideas are used to achieve the hierarchy and preservation of important system properties. These properties include liveness, boundedness/safeness, and reversibility that guarantee the system to operate in a stable, deadlock-free, and cyclic manner. Furthermore, the analysis of a timed Petri net for cycle time is presented. The timed Petri net is first converted into an equivalent timed marked graph by a reduction technique. Then the standard procedure to find the cycle time for marked graphs is applied. >

Journal ArticleDOI
28 Jun 1993
TL;DR: In this paper the theory of timing verification with time Petri nets and temporal logic is presented, a concrete model checking algorithm is developed and proved to be correct, and some experimental results demonstrating the efficiency of the method are given.
Abstract: This paper presents an efficient model checking algorithm for one–safe time Petri nets and a timed temporal logic. The approach is based on the idea of (1) using only differences of timing variables to be able to construct a finite representation of the set of all reachable states and (2) further reducing the size of this representation by exploiting the concurrency in the net. This reduction of the state space is possible, because the considered linear–time temporal logic is stuttering invariant. The firings of transitions are only partially ordered by causality and a given formula; therefore the order of firings of independent transitions is irrelevant, and only one of several equivalent interleavings has to be generated for the evaluation of the given formula. In this paper the theory of timing verification with time Petri nets and temporal logic is presented, a concrete model checking algorithm is developed and proved to be correct, and some experimental results demonstrating the efficiency of the method are given.

Proceedings Article
01 Jan 1993
TL;DR: Stochastic processes generated by the composition of stochastic automata can be analyzed efficiently with a technique based on Kronecker (tensor) algebra for matrices, as shown by Plateau.
Abstract: Stochastic processes generated by the composition of stochastic automata can be analyzed efficiently (both in terms of space and time) with a technique based on Kronecker (tensor) algebra for matrices, as shown by Plateau. The technique is applied in this paper to the analysis of a class of Stochastic Petri nets (SPN) that is named Superposed Stochastic Automata (SSA) an it is used to solve nets of hundreds of thousands states. The evaluation of the steady state probability distribution for this class of models was implemented with sequential as well as parallel algorithms. Although SSA are a rather restricted subclass of SPN, the extension of the analysis methodology to a more general setting appears to be feasible.

Proceedings ArticleDOI
22 Jun 1993
TL;DR: The tool supports the evaluation of different measures of dependability, including pointwise measures, asymptotic measures, mean sojourn times and, by superposing a reward structure on the behavior model, reward measures such as expected performance or cost.
Abstract: SURF-2, a software tool for evaluating system dependability, is described. It is especially designed for an evaluation-based system design approach in which multiple design solutions need to be compared from the dependability viewpoint. System behavior may be modeled either by Markov chains or by generalized stochastic Petri nets. The tool supports the evaluation of different measures of dependability, including pointwise measures, asymptotic measures, mean sojourn times and, by superposing a reward structure on the behavior model, reward measures such as expected performance or cost.

Journal ArticleDOI
TL;DR: In this paper, the analysis of a class of Stochastic Petri nets (SPN) that is named Superposed Stochian Automata (SSA) is presented.

Book ChapterDOI
21 Jun 1993
TL;DR: It is shown that the continuous time stochastic process underlying the DSPN with this condition is a Markov regenerative process and a method for computing the transient behavior is developed and consistent with the method of Ajmone Marsan and Chiola.
Abstract: Deterministic and stochastic Petri nets (DSPNs) are recognized as a useful modeling technique because of their capability to represent constant delays which appear in many practical systems. If at most one deterministic transition is allowed to be enabled in each marking, the state probabilities of a DSPN can be obtained analytically rather than by simulation. We show that the continuous time stochastic process underlying the DSPN with this condition is a Markov regenerative process and develop a method for computing the transient (time dependent) behavior. We also provide a steady state solution method using Markov regenerative process theory and show that it is consistent with the method of Ajmone Marsan and Chiola.

Proceedings ArticleDOI
02 May 1993
TL;DR: An approach to process modeling, task synthesis, and motion control for robotic assembly is presented, modeled as a discrete-event dynamic system using Petri nets and incorporating both discrete and continuous aspects of the process.
Abstract: An approach to process modeling, task synthesis, and motion control for robotic assembly is presented. Assembly is modeled as a discrete-event dynamic system using Petri nets and incorporating both discrete and continuous aspects of the process. To accomplish a desired trajectory, a discrete event controller is developed. The controller issues velocity commands that direct the system toward the next desired contact state, while maintaining currently desired contacts and avoiding unwanted transitions. Experimental results are given for a dual peg-in-the-hole example. The results not only demonstrate highly successful insertion along the optimal trajectory, but also demonstrate the ability to detect, recognize, and recover from errors and unwanted situations. >

Journal ArticleDOI
TL;DR: An approach to RBS verification in which the system is modeled as a Petri net on which error detection is performed is presented, and a set of propositions are formulated to locate errors of redundancy, conflict, circularity, and gaps in domain knowledge.
Abstract: It is suggested that as rule-based system (RBS) technology gains wider acceptance, the need to create and maintain large knowledge bases will assume greater importance. Demonstrating a rule base to be free from error remains one of the obstacles to the adoption of this technology. An approach to RBS verification in which the system is modeled as a Petri net on which error detection is performed is presented. A set of propositions is formulated to locate errors of redundancy, conflict, circularity, and gaps in domain knowledge. Rigorous proofs of these propositions are provided. Difficulties in implementing a Petri net-based verifier and the potential restrictions of the applicability of this approach are discussed. >


Journal ArticleDOI
Yang Kyu Lee1, Sung Joo Park1
TL;DR: The modeling experiences with OPNets demonstrate that the decoupling and separation of knowledges and constraints clearly enhances maintenance and reusability in real-time system modeling.

Journal ArticleDOI
01 Jan 1993
TL;DR: While controlling manufacturing systems, real time data is collected through sensory devices or some other means and fed back to the controller for the purpose of monitoring that system and modeling the control system by a time Petri net permits an analytical procedure for fault detection.
Abstract: While controlling manufacturing systems, real time data is collected through sensory devices or some other means and fed back to the controller for the purpose of monitoring that system. Monitoring refers to the analysis of data collected from the system. It involves fault detection and diagnostics. Here, we shall emphasize the fault detection aspects of monitoring. Modeling the control system by a time Petri net permits us to develop an analytical procedure for fault detection. By backfiring transitions in the time Petri net, we are able to determine if a given state is invalid. The back-firing approach also provides us with state space representation of time Petri nets and the maximum token holding times in different places of time Petri nets. >

Proceedings ArticleDOI
19 Oct 1993
TL;DR: The definition of a subordinated Markov chain (SMC) is refined to reduce the computational cost of deriving the transition probabilities of the embedded MarkOV chain (EMC) underlying a DSPN.
Abstract: A time and space efficient algorithm for computing steady state solutions of deterministic and stochastic Petri nets (DSPNs) with both stochastic and structural extensions is presented. The algorithm can deal with different execution policies associated with deterministic transitions of a DSPN. The definition of a subordinated Markov chain (SMC) is refined to reduce the computational cost of deriving the transition probabilities of the embedded Markov chain (EMC) underlying a DSPN. Closed-form expressions of these transition probabilities are presented for some SMC topologies. Moreover, the use of the reward structured defined on the DSPN to reduce memory requirements is proposed. The usefulness of the proposed extensions and the steps of the solution algorithm are illustrated using a DSPN of a simple communication protocol. >

Book ChapterDOI
14 Jun 1993
TL;DR: This paper presents the syntax of a concurrent programming notation which integrates a variety of process interaction techniques, its compositional Petri net semantics via the Box calculus, and an example of using the semantics for program verification.
Abstract: This paper presents the syntax of a concurrent programming notation which integrates a variety of process interaction techniques, its compositional Petri net semantics via the Box calculus, and an example of using the semantics for program verification.

Journal ArticleDOI
TL;DR: An efficient algorithm for calculating the time-dependent quantities required by the numerical solution process of Deterministic and Stochastic Petri Nets (DSPNs), which employs the randomization technique and a stable calculation of Poisson probabilities is introduced.