Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP

Glabbeek, Robert van

doi:10.1007/978-3-319-23506-6_9

Cited by 19 publications

(32 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, in the CCS [16] terminology, the marking for a.b.0 + b.a.0 and that for a.0|b.0 (see, e.g., [9]). As a matter of fact, place bisimilarity is a truly concurrent behavioral equivalence, which is slightly finer than structure preserving bisimilarity [8], in turn slightly finer than fully-concurrent bisimilarity [3]. Example 2.…”

Section: Place Bisimulation and Its Propertiesmentioning

confidence: 99%

“…Place bisimilarity seems a very natural behavioral equivalence for finite P/T Petri nets, which respects the expected causal behavior, as it is slightly finer than structure preserving bisimilarity [8], in turn slightly finer than fullyconcurrent bisimilarity [3]. Significantly, to date, it is the first sensible (i.e., fully respecting causality and branching time) behavioral equivalence which has been proved decidable for finite P/T nets (with the relevant exception of net isomorphism), even if its complexity is exponential in the size of the net.…”

Section: Conclusion and Future Researchmentioning

confidence: 99%

“…This equivalence is very natural and intuitive: as a place can be interpreted as a sequential process type (and each token in this place as an instance of a sequential process of that type), a place bisimulation essentially states which kinds of sequential processes (composing the distributed system represented by the Petri net) are to be considered equivalent. Moreover, this equivalence does respect the expected causal behavior of Petri nets; as a matter of fact, van Glabbeek proved in [8] that place bisimilarity is slightly finer than structure preserving bisimilarity [8], in turn slightly finer than fully-concurrent bisimilarity [3] (or, equivalently, history-preserving bisimilarity [21], [7], [4]).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Place Bisimilarity is Decidable, Indeed!

Gorrieri¹

2021

Preprint

View full text Add to dashboard Cite

Place bisimilarity ∼ p is a behavioral equivalence for finite Petri nets, proposed by Schnoebelen and co-workers in 1991. Differently from all the other behavioral relations proposed so far, a place bisimulation is not defined over the markings of a finite net, rather over its places, which are finitely many. However, place bisimilarity is not coinductive, as the union of place bisimulations may be not a place bisimulation. Place bisimilarity ∼ p was claimed decidable in [1], even if the algorithm used to this aim [2] does not characterize this equivalence, rather the unique maximal place bisimulation which is also an equivalence relation; hence, its decidability was not proved. Here we show that it is possible to decide ∼ p with a simple, yet inefficient, algorithm, which essentially scans all the place relations (which are finitely many) to check whether they are place bisimulations. Moreover, we propose a slightly coarser variant, we call d-place bisimilarity, that we conjecture to be the coarsest equivalence, fully respecting causality and branching time, to be decidable on finite Petri nets.

show abstract

Section: Place Bisimulation and Its Propertiesmentioning

confidence: 99%

Section: Conclusion and Future Researchmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Place Bisimilarity is Decidable, Indeed!

Gorrieri¹

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…However, it would be interesting to investigate in future work whether, by introducing explicit fairness assumptions, the type system can be liberated to permit more processes to be typed while maintaining lock-freedom. Recent work [18,17] suggests that weak notions of fairness are sufficient assumptions to ensure lock-freedom. In particular, it appears that justness is sufficient; where justness assumes that one party cannot prevent another party from eventually acting; thereby avoiding scenarios where one party schedules her actions in such a way that an action critical for another party to progress cannot occur.…”

Section: Related Workmentioning

confidence: 99%

Global types with internal delegation

Castellani

Dezani‐Ciancaglini

Giannini

et al. 2020

Theoretical Computer Science

View full text Add to dashboard Cite

This paper investigates a new form of delegation for multiparty session calculi. Usually, delegation allows a session participant to appoint a participant in another session to act on her behalf. This means that delegation is inherently an inter-session mechanism, which requires session interleaving. Hence delegation falls outside the descriptive power of global types, which specify single sessions. As a consequence, properties such as deadlock-freedom or lock-freedom are difficult to ensure in the presence of delegation. Here we adopt a different view of delegation, by allowing participants to delegate tasks to each other within the same multiparty session. This way, delegation occurs within a single session (internal delegation) and may be captured by its global type. To increase flexibility in the use of delegation, our calculus uses connecting communications, which allow optional participants in the branches of choices. By these means, we are able to express conditional delegation. We present a session type system based on global types with internal delegation, and show that it ensures the usual safety properties of multiparty sessions, together with a progress property.

show abstract

“…This example is not a contrived corner case, but a rather typical illustration of an issue that is central to the study of distributed systems. Other illustrations of this phenomena occur in [10, Section 9.1], [14,Section 10], [11,Section 1.4], [12] and [6,Section 4]. The criterion of justness aims to ensure the liveness property occurring in these examples.…”

Section: Example 2 the Transition System On The Top Right Modelsmentioning

confidence: 99%

Justness

Glabbeek

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper poses that transition systems constitute a good model of distributed systems only in combination with a criterion telling which paths model complete runs of the represented systems. Among such criteria, progress is too weak to capture relevant liveness properties, and fairness is often too strong; for typical applications we advocate the intermediate criterion of justness. Previously, we proposed a definition of justness in terms of an asymmetric concurrency relation between transitions. Here we define such a concurrency relation for the transition systems associated to the process algebra CCS as well as its extensions with broadcast communication and signals, thereby making these process algebras suitable for capturing liveness properties requiring justness.

show abstract

Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP

Cited by 19 publications

References 31 publications

Place Bisimilarity is Decidable, Indeed!

Place Bisimilarity is Decidable, Indeed!

Global types with internal delegation

Justness

Contact Info

Product

Resources

About