Topic
Petri net
About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: Modeling elements that have gained widespread use for general systems, as well as fault-tolerant systems, are included and can be used to aid in selecting models and tools for a particular application or designing tools for future needs.
Abstract: In computer design, it is essential to know the effectiveness of different design options in improving performance and dependability. Various software tools have been created to evaluate these parameters, applying both analytic and simulation techniques, and this paper reviews those related primarily to reliability, availability, and serviceability. The purpose, type of models used, type of systems modeled, inputs, and outputs are given for each package. Examples of some of the key modeling elements such as Markov chains, fault trees, and Petri nets are discussed. The information is compiled to facilitate recognition of similarities and differences between various models and tools and can be used to aid in selecting models and tools for a particular application or designing tools for future needs. Tools included in the evaluation are CARE-III, ARIES-82, SAVE, MARKl, HARP, SHARPE, GRAMP, SURF, SURE, ASSIST, METASAN, METFAC, ARM, and SUPER. Modeling tools, such as REL70, RELCOMP, CARE, CARSRA, and CAST, that were forerunners to some of the current tools are noted for their contributions. Modeling elements that have gained widespread use for general systems, as well as fault-tolerant systems, are included. Tools capable of modeling both repairable and nonrepairable systems, accepting constant or time varying failure rates, and predicting reliability, availability, and serviceability parameters are surveyed.
189 citations
28 Sep 2007
TL;DR: An extension of a Petri net semantics for the Web Service Business Execution Language (WS-BPEL) covers the novel activities and constructs introduced by the recent WS- BPEL 2.0 specification and simplifies several aspects of the PetriNet semantics to allow for more compact models suited for computer-aided verification.
Abstract: We present an extension of a Petri net semantics for the Web Service Business Execution Language (WS-BPEL). This extension covers the novel activities and constructs introduced by the recent WS-BPEL 2.0 specification. Furthermore, we simplify several aspects of the Petri net semantics to allow for more compact models suited for computer-aided verification.
189 citations
TL;DR: This paper describes an approach for calculating a safe change region and explains how to deal with the dynamic change bug, which can lead to duplication of work, skipping of tasks, deadlocks, and livelocks in workflow management.
Abstract: Adaptability has become one of the major research topics in the area of workflow management. Today's workflow management systems have problems dealing with both ad-hoc changes and evolutionary changes. As a result, the workflow management system is not used to support dynamically changing workflow processes or the workflow process is supported in a rigid manner, i.e., changes are not allowed or handled outside of the workflow management system. In this paper, we focus on a notorious problem caused by workflow change: the “dynamic change bug” (Ellis et al.s Proceedings of the Conference on Organizational Computing Systems, Milpitas, California, ACM SIGOIS, ACM Press, New York, 1995, pp. 10–21). The dynamic change bug refers to errors introduced by migrating a case (i.e., a process instance) from the old process definition to the new one. A transfer from the old process to the new process can lead to duplication of work, skipping of tasks, deadlocks, and livelocks. This paper describes an approach for calculating a safe change region. If a case is in such a change region, the transfer is postponed.
186 citations
Book•
01 Jan 2002
TL;DR: In this book abstraction is used to create larger nets from smaller ones, and this kind of abstraction will be represented graphically as shown in Figure 2.13c.
Abstract: ion, however, has a meaningful interpretation. To give an example, consider the fragment of a net in Figure 2.13a. Intuitively the abstraction in 2.4 Refinement and Composition 21 Figure 2.13d has a corresponding behaviour ("a token is passed through"). Figure 2.13d is also an abstraction of Figure 2.13b, but now the behaviour is different. In Figure 2.13d a token can pass, but not so in Figure 2.13b. Note that the set Y to be abstracted is not necessarily connected as a subgraph. However, Figure 2.13d can be interpreted as a merge of two places. This operation is called a fusion of places or place fusion. It will be used in Part II of this book to create larger nets from smaller ones. This kind of abstraction will be represented graphically as shown in Figure 2.13c. The dual situation for a transition-bordered set is shown in Figures 2.13e-h. Thus Figures 2.13f, g and h describe a fusion of transitions or transition fusion. -1 -I
186 citations