Petri net

About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.

Testing BPEL-based Web Service Composition Using High-level Petri Nets

Abstract: This paper proposes a technique for analysis and testing BPEL-based web service composition using High-level Petri Nets. To illustrate how these compositions are verified, the relationships between BPEL-based web service composition and High-level Petri Nets is constructed. By analyzing the structure of web service composition based on BPEL, the corresponding HPN is constructed. The dynamism and occurrence are presented in HPN with guard expression with coloured token. After translation, the equivalent HPN of the web service composition based on BPEL can be verified on existing mature tool, and the related researches on HPN, e.g. testing coverage and reduction techniques that have been studied deeply, can be employed in testing of web service composition based on BPEL, optimized test case can be generated based on the HPN translated. An example is provided to illustrate the translation ruled and the automatic verify progress.

On the Decidability of Model Checking for Several µ-calculi and Petri Nets

Abstract: The decidability of the model checking problem for several μ-calculi and Petri nets is analysed. The linear time μ-calculus without atomic sentences is decidable; if simple atomic sentences are added, it becomes undecidable. A very simple subset of the modal μ-calculus is undecidable.

Integration and analysis of use cases using modular Petri nets in requirements engineering

Abstract: It is well known that requirements engineering plays a critical role in software quality. The use case approach is a requirements elicitation technique commonly used in industrial applications. Software requirements are stated as a collection of use cases, each of which is written in the user's perspective and describes a specific flow of events in the system. The use case approach offers several practical advantages in that use case requirements are relatively easy to describe, understand, and trace. Unfortunately, there are a couple of major drawbacks. Since use cases are often stated in natural languages, they lack formal syntax and semantics. Furthermore, it is difficult to analyze their global system behavior for completeness and consistency, partly because use cases describe only partial behaviors and because interactions among them are rarely represented explicitly. We propose the Constraints-based Modular Petri Nets (CMPNs) approach as an effective way to formalize the informal aspects of use cases. CMPNs, an extension of Place/Transition nets, allow the formal and incremental specification of requirements. The major contributions of the paper, in addition to the formal definitions of CMPNs, are the development of: 1) a systematic procedure to convert use cases stated in natural language to a CMPN model; and 2) a set of guidelines to find inconsistency and incompleteness in CMPNs. We demonstrate an application of our approach using use cases developed for telecommunications services.

A Toolbox for Functional and Quantitative Analysis of DEDS

Abstract: We present a toolbox for the combined functional and quantitative analysis of discrete event dynamic systems (DEDS) on the basis of a common model interchange format, the Abstract Petri Net Notation (APNN,[5]). This format covers a fair amount of Petri net like formalisms as well as certain Queueing network concepts. At a lower level the toolbox uses a format for communicating stochastic automata, a notation to describe DEDS at a state transition level. For a more detailed description of the toolbox we refer to [3].