A survey of equivalence notions for net based systems

Pomello, Lucia; Rozenberg, Grzegorz; Simone, Carla

doi:10.1007/3-540-55610-9_180

Cited by 74 publications

(35 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When applied in the context of model refinement and adaptation, the multitude of equivalence criteria from the linear time -branching time spectrum [35,5] has three major drawbacks. First and foremost, these notions yield a true or false answer, which has been criticised in [36].…”

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

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

show abstract

“…There are not many net-based equivalence notions that are based on the observation of both actions and states [7]. The interface equivalence in [10] belongs to this class.…”

Section: The Equivalencementioning

confidence: 99%

“…Ref. [7] is a good survey for the simulation relations between net-based systems. To define subtyping relations from behavior simulation relations, the main decisions include (1) the observation of actions [3][4], or states [1], or both; (2) expressive or pragmatic; (3) action blocking, or action hiding, or hybrid [8].…”

Section: Introductionmentioning

confidence: 99%

A pragmatic behavior subtyping relation based on both states and actions

Wang

Jian

Yuan

2001

J. Comput. Sci. & Technol.

View full text Add to dashboard Cite

Abstract.A behavior preserving relation between Petri-net systems is introduced in this paper, basing on the observability of both places and transitions, which is important in modeling the dynamic behavior of concurrent object-oriented systems with Petri nets. Each group of closely related attributes of a concurrent object is modeled by the state of a collection of observable places, and each of its methods by a group of observable transitions. The grouping distinguishes our definition from others, which makes it easy to work together with the static object models, to reuse the models and to dispel the interference among groups, thus relieving the problem of inheritance anomaly by the possibility of dividing the synchronization code into independent parts. For a formal definition of this behavior subtyping relation, Elementary Net systems, with both S-elements and T-elements labeled, are used. Then it is extended informally to state based colored Petri net systems. Finally, the background of the definitions and our future work is presented.

show abstract

“…This solves the open problem of providing a process calculus representing finite P/T Petri nets, and opens interesting possibilities of cross-fertilization between the areas of Petri nets and process calculi. In particular, it is now possible, on the one hand, (i) to define any (statically reduced) finite P/T net compositionally and (ii) to study algebraic laws for net-based behavioral equivalences (such as net isomorphism) over such a class of systems; on the other hand, it is now possible (iii) to reuse all the techniques and decidability results available for finite P/T nets [12] also for this fragment of multi-CCS, as well as (iv) to continue the study of non-interleaving semantics, typical of Petri nets (e.g., [11,27,29]), also for process algebras (initiated in [8,28]), in particular for finite-net multi-CCS.…”

Section: Introductionmentioning

confidence: 99%

Language representability of finite place/transition Petri nets

Gorrieri

2015

Vietnam J Comput Sci

View full text Add to dashboard Cite

Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, together with parallel composition, also multi-party synchronization. This calculus is equipped with a labeled transition system semantics and also with an unsafe P/T Petri net semantics, which is sound w.r.t. the transition system semantics. For any process p of the calculus, the net associated to p by the semantics has always a finite number of places, but it has a finite number of transitions only for so-called well-formed processes. The main result of the paper is that well-formed finite-net multi-CCS processes are able to represent all finite, statically reduced, P/T Petri nets.

show abstract

A survey of equivalence notions for net based systems

Cited by 74 publications

References 43 publications

Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition

Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition

A pragmatic behavior subtyping relation based on both states and actions

Language representability of finite place/transition Petri nets

Contact Info

Product

Resources

About