Topic
Process architecture
About: Process architecture is a research topic. Over the lifetime, 4876 publications have been published within this topic receiving 104171 citations.
Papers published on a yearly basis
Papers
More filters
01 Jan 2007
TL;DR: Monmouth University 24.1 as discussed by the authors 7.5.0 as discussed by the authors 0.1.0 0.00 0.0 2.0 1.1 0.2 0.
Abstract: Monmouth University 24.
90 citations
25 Jun 2007
TL;DR: It is demonstrated that the basic features of Petri nets do not only lead to additional analysis techniques, but as well to improved implementations of formalism-independent techniques.
Abstract: Most specific characteristics of (Place/Transition) Petri nets can be traced back to a few basic features including the monotonicity of the enabling condition, the linearity of the firing rule, and the locality of both. These features enable "Petri net" analysis techniques such as the invariant calculus, the coverability graph technique, approaches based on unfolding, or structural (such as siphon/trap based) analysis. In addition, most verification techniques developed outside the realm of Petri nets can be applied to Petri nets as well.
In this paper, we want to demonstrate that the basic features of Petri nets do not only lead to additional analysis techniques, but as well to improved implementations of formalism-independent techniques. As an example, we discuss the explicit generation of a state space. We underline our arguments with some experience from the implementation and use of the Petri net based state space tool LoLA.
90 citations
01 Jan 2005
TL;DR: This papers describes a first attempt to map a BPEL process model onto a WF-net, and although not all BPEL constructs have been mapped yet, the results seem promising, as it is able to map typical examples from the BPEL 1.1 specification onto Wf-nets.
Abstract: Some years ago, BEA, IBM, Microsoft, SAP AG, and Siebel Systems teamed up and proposed the Business Process Execution Language for Web Services (BPEL or BPEL4WS) for application integration within and across organizational boundaries. By now, BPEL has become the de facto standard in this Web services composition arena. However, little effort has been dedicated so far concerning the verification of the modeled business processes. For example, there is no support to detect possible deadlocks, or to detect parts of the process that are not viable. For so-called WF-nets (workflow nets), techniques and tools exist which make it possible to detect such anomalies. Therefore, we could detect these anomalies in a BPEL process model provided that we can successfully map this model onto a WF-net. This papers describes a first attempt to map a BPEL process model onto a WF-net. Although not all BPEL constructs have been mapped yet, the results seem promising, as we are able to map typical examples from the BPEL 1.1 specification onto WF-nets.
90 citations
09 Dec 1973
TL;DR: The capabilities and limitations of Petri nets are examined and techniques for proving their correctness are investigated and the feasibility of using the methods of computational induction and inductive assertions to prove restricted statements about Petrinets is established.
Abstract: In this paper we examine the capabilities and limitations of Petri nets and investigate techniques for proving their correctness. We define different classes of nets where each is basically a Petri net with slight modifications and study the relationship between the various classes. One particular class appears to be quite powerful, with respect to its capability for representing coordinations. In the second part of the paper we establish the feasibility of using the methods of computational induction and inductive assertions to prove restricted statements about Petri nets.
90 citations