Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP

Fröschle, Sibylle; Lasota, Sławomir

doi:10.1007/11539452_22

Cited by 10 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach is based on an intuition very similar to [23,24], where Fröschle extends the unique decomposition idea, originally proposed in [48] for interleaving bisimilarity over finite BPP (i.e., BPP without constants/recursion), to a trulyconcurrent setting. She proposes to consider the decomposition of a truly-concurrent semantic model (e.g., 1-safe P/T net, or asynchronous transition system [59]) so that it can be dissected into independent 'chunks of behaviour'.…”

Section: A1 Associativitymentioning

confidence: 99%

See 1 more Smart Citation

Team bisimilarity, and its associated modal logic, for BPP nets

Gorrieri

2020

Acta Informatica

View full text Add to dashboard Cite

BPP nets, a subclass of finite Place/Transition Petri nets, are equipped with an efficiently decidable, truly concurrent, bisimulation-based, behavioral equivalence, called team bisimilarity. This equivalence is a very intuitive extension of classic bisimulation equivalence (over labeled transition systems) to BPP nets and it is checked in a distributed manner, without necessarily building a global model of the overall behavior of the marked BPP net. An associated distributed modal logic, called team modal logic (TML, for short), is presented and shown to be coherent with team bisimilarity: two markings are team bisimilar if and only if they satisfy the same TML formulae. As the process algebra BPP (with guarded summation and guarded body of constants) is expressive enough to represent all and only the BPP nets, we provide algebraic laws for team bisimilarity as well as a finite, sound and complete, axiomatization.

show abstract

Section: A1 Associativitymentioning

confidence: 99%

“…While these three calculi have the same expressive power w.r.t. interleaving semantics, in the true-concurrency world full BPP is strictly more expressive than SBPP [23][24][25], while SBPP and our BPP are equally expressive as it is possible to adapt the net semantics for SBPP in [20] to generate all (and only) the BPP nets as well.…”

Section: Introductionmentioning

confidence: 99%

Team bisimilarity, and its associated modal logic, for BPP nets

Gorrieri

2020

Acta Informatica

View full text Add to dashboard Cite

show abstract

“…Remark 6.5. Game characterisations of HH equivalence have been used many times before -see, for example, Fröschle (1999), Fröschle (2005), Fröschle and Lasota (2005), Jurdzinski et al (2003) and Gutierrez (2009). However, Defender is usually said to win if the play continues for ever, whereas we say that Defender wins if a state is repeated.…”

Section: Characteristic Formulasmentioning

confidence: 99%

Event Identifier Logic

Phillips¹,

Ulidowski²

2013

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

In this paper we introduce Event Identifier Logic (EIL), which extends Hennessy–Milner logic by the addition of: (1)reverse as well as forward modalities; and(2)identifiers to keep track of events. We show that this logic corresponds to hereditary history-preserving (HH) bisimulation equivalence within a particular true-concurrency model, namely, stable configuration structures. We also show how natural sublogics of EIL correspond to coarser equivalences. In particular, we provide logical characterisations of weak-history- preserving (WH) and history-preserving (H) bisimulation. Logics corresponding to HH and H bisimulation have been given previously, but none, as far as we are aware, corresponding to WH bisimulation (when autoconcurrency is allowed). We also present characteristic formulas that characterise individual structures with respect to history-preserving equivalences.

show abstract

“…Certainly game characterisations of HH equivalence have been used many times before; see e.g. [9,10,11,22,17]. However defender is usually said to win if the play continues for ever, whereas we say that defender wins if a state is repeated.…”

Section: Characteristic Formulasmentioning

confidence: 99%

A Logic with Reverse Modalities for History-preserving Bisimulations

Phillips

Ulidowski

2011

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We introduce event identifier logic (EIL) which extends Hennessy-Milner logic by the addition of (1) reverse as well as forward modalities, and (2) identifiers to keep track of events. We show that this logic corresponds to hereditary history-preserving (HH) bisimulation equivalence within a particular true-concurrency model, namely stable configuration structures. We furthermore show how natural sublogics of EIL correspond to coarser equivalences. In particular we provide logical characterisations of weak history-preserving (WH) and history-preserving (H) bisimulation. Logics corresponding to HH and H bisimulation have been given previously, but not to WH bisimulation (when autoconcurrency is allowed), as far as we are aware. We also present characteristic formulas which characterise individual structures with respect to history-preserving equivalences

show abstract

Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP

Cited by 10 publications

References 14 publications

Team bisimilarity, and its associated modal logic, for BPP nets

Team bisimilarity, and its associated modal logic, for BPP nets

Event Identifier Logic

A Logic with Reverse Modalities for History-preserving Bisimulations

Contact Info

Product

Resources

About