A survey of behaviour and equivalence preserving refinements of petri nets

Brauer, Wilfried; Gold, Robert S.; Vogler, Walter

doi:10.1007/3-540-53863-1_19

Cited by 70 publications

(37 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Without loss of generality, we assume that each transition in N performs at most one action. In particular, in states s 4 , s 5 and s 7 , Fig. 4 excludes producing a token in q for the second time before any token has been consumed from p; thus excluding the example in Fig.…”

Section: Some Transitions Should Not Occurmentioning

confidence: 99%

See 1 more Smart Citation

Soundness-Preserving Refinements of Service Compositions

Hee

Mooij

Sidorova

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Soundness is one of the well-studied properties of processes; it denotes that a final state can be reached from every state that is reachable from the initial state. Soundness-preserving refinements are important for enabling the compositional design of systems.In this paper we concentrate on refinements of service compositions. We model service compositions using Petri nets, and consider specific pairs of places that belong to different services. Starting from a sound service composition, we show how to check whether such a pair of places can be refined by another sound service composition, so that soundness is preserved through the refinement.

show abstract

Section: Some Transitions Should Not Occurmentioning

confidence: 99%

“…A nice overview of fundamental refinement techniques for Petri nets is given in [4,29]. In the context of component-based systems and service-oriented technologies, a lot of research considers communicating systems, see e.g., [14,26,27], in combination with some variants of soundness.…”

Section: Introductionmentioning

confidence: 99%

Soundness-Preserving Refinements of Service Compositions

Hee

Mooij

Sidorova

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…These phenomena, in turn, can be quantified using the causal behavioural profile. Moreover, work on equivalence-preserving refinements for Petri nets, refer to [38] for a thorough survey, illustrates that common notions of equivalence are preserved solely under certain refinement operators. Similarly, work on net morphisms [39] and behaviour inheritance [40,41] shows that any extension of a net has to be done in a structured manner in order to preserve common equivalences.…”

Section: Related Workmentioning

confidence: 99%

Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition

Weidlich

Polyvyanyy

Mendling

et al. 2010

Applications and Theory of Petri Nets

View full text Add to dashboard Cite

Abstract. Identification of behavioural contradictions is an important aspect of software engineering, in particular for checking the consistency between a business process model used as system specification and a corresponding workflow model used as implementation. In this paper, we propose causal behavioural profiles as the basis for a consistency notion, which capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities. Existing notions of behavioural equivalence, such as bisimulation and trace equivalence, might also be applied as consistency notions. Still, they are exponential in computation. Our novel concept of causal behavioural profiles provides a weaker behavioural consistency notion that can be computed efficiently using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S-or T-nets.

show abstract

“…While Petri nets and temporal logic are good at describing properties that pertain to the complete systems, however, they are relatively unstructured and not ideal for compositional verification[l 1]. Recent work on the compositionality or modularity of Petri nets [6,2,3,10] and the emergence of high-level timed Petri nets [7,17] has made them more attractive to the specification and analysis of complex real-time systems.…”

Section: Direct Waymentioning

confidence: 99%

An improved translation of SA/RT specification model to high-level timed Petri nets

Shi

Nixon

1996

FME'96: Industrial Benefit and Advances in Formal Methods

View full text Add to dashboard Cite

Abstract. Structured analysis methods for real-time systems (SA/RT) are widely accepted by the industrial world as a mature approach to real-time systems design. These methods use highly expressive graphical specification languages to specify system requirements. Giving semantics to SA/RT specifications via selected formal models has the advantage of not only retaining their user-friendly and problem-oriented characteristics, but also making good use of the existing results of formal models for easier simulation and more powerful analysis. An automatic translation from SA/RT specification models to high-level timed Petri nets has recently been reported in [5]. But this translation suffers from some drawbacks, especially that it is not compositional, and the resulting subnets, in some cases, can be of at least exponential complexity. In this paper, we propose an improved translation, which is compositional and the resulting nets are of much lower complexity, e.g. the number of transitions is linear with respect to the scale of the original model. The efficient translation will benefit the simulation and analysis of specifications, and the compositionality of the translation process will support their incremental or modular development and compositional analysis.

show abstract

A survey of behaviour and equivalence preserving refinements of petri nets

Cited by 70 publications

References 31 publications

Soundness-Preserving Refinements of Service Compositions

Soundness-Preserving Refinements of Service Compositions

Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition

An improved translation of SA/RT specification model to high-level timed Petri nets

Contact Info

Product

Resources

About