Results 1  10
of
51
The Application of Petri Nets to Workflow Management
, 1998
"... Workflow management promises a new solution to an ageold problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the ..."
Abstract

Cited by 522 (61 self)
 Add to MetaCart
Workflow management promises a new solution to an ageold problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the use of Petri nets in the context of workflow management. Petri nets are an established tool for modeling and analyzing processes. On the one hand, Petri nets can be used as a design language for the specification of complex workflows. On the other hand, Petri net theory provides for powerful analysis techniques which can be used to verify the correctness of workflow procedures. This paper introduces workflow management as an application domain for Petri nets, presents stateoftheart results with respect to the verification of workflows, and highlights some Petrinetbased workflow tools.
Simulation, verification, automated composition of web services
 In WWW
, 2002
"... Web services Webaccessible programs and devices – are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semantic Web comes the opportunity to automate various Web services tasks. Our objective is to enable markup and automated reason ..."
Abstract

Cited by 387 (7 self)
 Add to MetaCart
(Show Context)
Web services Webaccessible programs and devices – are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semantic Web comes the opportunity to automate various Web services tasks. Our objective is to enable markup and automated reasoning technology to describe, simulate, compose, test, and verify compositions of Web services. We take as our starting point the DAMLS DAML+OIL ontology for describing the capabilities of Web services. We define the semantics for a relevant subset of DAMLS in terms of a firstorder logical language. With the semantics in hand, we encode our service descriptions in a Petri Net formalism and provide decision procedures for Web service simulation, verification and composition. We also provide an analysis of the complexity of these tasks under different restrictions to the DAMLS composite services we can describe. Finally, we present an implementation of our analysis techniques. This implementation takes as input a DAMLS description of a Web service, automatically generates a Petri Net and performs the desired analysis. Such a tool has broad applicability both as a back end to existing manual Web service composition tools, and as a standalone tool for Web service developers.
Decidability Issues for Petri Nets  a survey
, 1994
"... : We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics. 1. Introduction Petri nets are one of the most popular formal models for the representation and analysis of parallel proc ..."
Abstract

Cited by 120 (5 self)
 Add to MetaCart
: We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics. 1. Introduction Petri nets are one of the most popular formal models for the representation and analysis of parallel processes. They are due to C.A. Petri, who introduced them in his doctoral dissertation in 1962. Some years later, and independently from Petri's work, Karp and Miller introduced vector addition systems [47], a simple mathematical structure which they used to analyse the properties of "parallel program schemata', a model for parallel computation. In their seminal paper on parallel program schemata, Karp and Miller studied some decidability issues for vector addition systems, and the topic continued to be investigated by other researchers. When Petri's ideas reached the States around 1970, it was observed that Petri nets and vector addition systems were mathematically equivalent, even though thei...
Decidability and complexity of Petri net problems  an Introduction
 In Lectures on Petri Nets I: Basic Models
, 1998
"... . A collection of 10 "rules of thumb" is presented that helps to determine the decidability and complexity of a large number of Petri net problems. 1 ..."
Abstract

Cited by 106 (3 self)
 Add to MetaCart
(Show Context)
. A collection of 10 "rules of thumb" is presented that helps to determine the decidability and complexity of a large number of Petri net problems. 1
Workflow Verification: Finding ControlFlow Errors Using PetriNetBased Techniques
, 2000
"... . Workflow management systems facilitate the everyday operation of business processes by taking care of the logistic control of work. In contrast to traditional information systems, they attempt to support frequent changes of the workflows at hand. Therefore, the need for analysis methods to veri ..."
Abstract

Cited by 87 (10 self)
 Add to MetaCart
. Workflow management systems facilitate the everyday operation of business processes by taking care of the logistic control of work. In contrast to traditional information systems, they attempt to support frequent changes of the workflows at hand. Therefore, the need for analysis methods to verify the correctness of workflows is becoming more prominent. In this chapter we present a method based on Petri nets. This analysis method exploits the structure of the Petri net to find potential errors in the design of the workflow. Moreover, the analysis method allows for the compositional verification of workflows. 1 Introduction Workflow management systems (WFMS) are used for the modeling, analysis, enactment, and coordination of structured business processes by groups of people. Business processes supported by a WFMS are casedriven, i.e., tasks are executed for specific cases. Approving loans, processing insurance claims, billing, processing tax declarations, handling traffic vio...
ContextBounded Analysis of Concurrent Queue Systems ⋆
"... Abstract. We show that the bounded contextswitching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only one queue (but is allowed to write onto all other queues). Our result also holds when indivi ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
(Show Context)
Abstract. We show that the bounded contextswitching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only one queue (but is allowed to write onto all other queues). Our result also holds when individual processes are finitestate recursive programs provided a process dequeues messages only when its local stack is empty. We then proceed to classify architectures that admit a decidable (unbounded context switching) reachability problem, using the decidability of bounded context switching. We show that the precise class of decidable architectures for recursive programs are the forest architectures, while the decidable architectures for nonrecursive programs are those that do not have an undirected cycle. 1
An Alternative Way to Analyze Workflow Graphs
 Proceedings of the 14th International Conference on Advanced Information Systems Engineering (CAiSE’02), volume 2348 of Lecture Notes in Computer Science
, 2002
"... At the CAiSE conference in Heidelberg in 1999, Wasim Sadiq and Maria Orlowska presented an algorithm to verify workflow graphs [19]. The algorithm uses a set of reduction rules to detect structural conflicts. This paper shows that the set of reduction rules presented in [19]isnot complete and propos ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
At the CAiSE conference in Heidelberg in 1999, Wasim Sadiq and Maria Orlowska presented an algorithm to verify workflow graphs [19]. The algorithm uses a set of reduction rules to detect structural conflicts. This paper shows that the set of reduction rules presented in [19]isnot complete and proposes an alternative algorithm. The algorithm translates workflow graphs into socalled WFnets. WFnets are a class of Petri nets tailored towards workflow analysis. As a result, Petrinet theory and tools can be used to verify workflow graphs. In particular, our workflow verification tool Woflan [21] can be used to detect design errors. It is shown that the absence of structural conflicts, i.e., deadlocks and lack of synchronization, conforms to soundness of the corresponding WFnet [2]. In contrast to the algorithm presented in [19], the algorithm presented in this paper is complete. Moreover, the complexity of this alternative algorithm is given. 1
On the Expressiveness of Linda Coordination Primitives
 Information and Computation
"... We introduce a process algebra containing the coordination primitives of Linda (asynchronous communication via a shared data space, read operation, nonblocking test operators on the shared space). We compare two possible semantics for the output operation: the former, that we call ordered, defines ..."
Abstract

Cited by 29 (12 self)
 Add to MetaCart
(Show Context)
We introduce a process algebra containing the coordination primitives of Linda (asynchronous communication via a shared data space, read operation, nonblocking test operators on the shared space). We compare two possible semantics for the output operation: the former, that we call ordered, defines the output as an operation that returns when the message has reached the shared data space; the latter, that we call unordered, returns just after sending the message to the tuple space. The process algebra under the ordered semantics is Turing powerful, as we are able to program any Random Access Machine. The main result of the paper is that the process algebra under the unordered semantics is not Turing powerful. This result is achieved by resorting to a net semantics in terms of contextual nets (P/T nets with inhibitor and read arcs), and showing that there exists a deadlockpreserving simulation of such nets by finite P/T nets, a formalism where termination is decidable. 1 Introduction ...
A Polynomial Algorithm to Compute the Concurrency Relation of Freechoice Signal Transition Graphs
 In Proc. of the International Workshop on Discrete Event Systems (WODES
, 1995
"... Freechoice Signal Transition Graphs (STG) are a class of interpreted Petri nets with applications to the verification and synthesis of speedindependet circuits. Several synthesis techniques for freechoice STGs have been proposed which require to know the concurrency relation of the net, i.e., the ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
(Show Context)
Freechoice Signal Transition Graphs (STG) are a class of interpreted Petri nets with applications to the verification and synthesis of speedindependet circuits. Several synthesis techniques for freechoice STGs have been proposed which require to know the concurrency relation of the net, i.e., the pairs of transitions that can become concurrently enabled at some reachable marking. We use some results about freechoice nets to derive an efficient polynomial algorithm for the computation of the concurrency relation. 1 Introduction Signal Transition Graphs (STGs) have become a popular and much studied formalism for the specification and verification of speed independent circuits [3, 9, 10]. STGs are bounded Petri nets whose transitions carry labels of the form y + , y \Gamma , where y is a circuit signal. 1 The occurrence of a transition with label y + raises y, i.e., sets its value to 1, while the occurrence of a transition with label y \Gamma lowers y, i.e., sets its value t...