Branching Bisimilarity with Explicit Divergence

Glabbeek, Rob van; Luttik, Bas; Trčka, N.

doi:10.3233/fi-2009-109

Cited by 66 publications

(42 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Contribution We define two decompositions of parallel communicating subsystems, one synchronous and the other asynchronous, and we prove that both decompositions maintain branching bisimilarity [4] with the source automaton. We also prove that there is no way of decomposing an automaton (under certain conditions) such that it is divergent-preserving branching-bisimilar [3] to the resulting decomposition.…”

Section: Introductionmentioning

confidence: 94%

Distribution of Behaviour into Parallel Communicating Subsystems

Alduhaiby

Groote

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The process of decomposing a complex system into simpler subsystems has been of interest to computer scientists over many decades, most recently for the field of distributed computing. In this paper, motivated by the desire to distribute the process of active automata learning onto multiple subsystems, we study the equivalence between a system and the total behaviour of its decomposition which comprises subsystems with communication between them. We show synchronouslyand asynchronously-communicating decompositions that maintain branching bisimilarity, and we prove that there is no decomposition operator by our definition that maintains divergence-preserving branching bisimilarity over all LTSs.

show abstract

Section: Introductionmentioning

confidence: 94%

Distribution of Behaviour into Parallel Communicating Subsystems

Alduhaiby

Groote

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Lemma 62 [18] If p 0 τ −→ p 1 τ −→ · · · τ −→ p n and p 0 ↔ ∆ b p n , then p 0 ↔ ∆ b p i for all i = 0, . .…”

Section: A Congruence Format For Divergence-preserving Branching Bisiunclassified

“…This version includes elaborate proofs of the results, provides additional explanations, and discusses sequencing as an extra example application. [3,16,18]. However, they are not congruences with respect to most process algebras from the literature, meaning that the equivalence class of a process f (p 1 , .…”

Section: Introductionmentioning

confidence: 99%

Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence

Fokkink

Glabbeek

Luttik

2019

Information and Computation

Self Cite

View full text Add to dashboard Cite

In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must ensure that the formulas in the modal characterisation of this semantics are always decomposed into formulas that are again in this modal characterisation. The stability and divergence requirements that are imposed on many of the known weak semantics have so far been outside the realm of this method. Stability refers to the absence of a τ-transition. We show, using the decomposition method, how congruence formats can be relaxed for weak semantics that are stability-respecting. This relaxation for instance brings the priority operator within the range of the stability-respecting branching bisimulation format. Divergence, which refers to the presence of an infinite sequence of τ-transitions, escapes the inductive decomposition method. We circumvent this problem by proving that a congruence format for a stability-respecting weak semantics is also a congruence format for its divergence-preserving counterpart.

show abstract

“…The relation ↔ ∆ b satisfies the conditions of Definition 3, and is, in fact, the largest divergencepreserving branching bisimulation relation. Divergence-preserving branching bisimilarity is an equivalence relation [15].…”

Section: Definitionmentioning

confidence: 99%

Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)

Baeten

Luttik

Yang

2017

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between context-free and pushdown processes fails modulo bisimilarity, and it is not clear how to specify an always terminating half counter. We propose a revised operational semantics for the sequential composition operator in the context of intermediate termination.With the revised operational semantics, we eliminate transparency, allowing us to establish a close correspondence between context-free processes and pushdown processes. Moreover, we prove the reactive Turing powerfulness of TCP with iteration and nesting with the revised operational semantics for sequential composition.

show abstract

Branching Bisimilarity with Explicit Divergence

Cited by 66 publications

References 9 publications

Distribution of Behaviour into Parallel Communicating Subsystems

Distribution of Behaviour into Parallel Communicating Subsystems

Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence

Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)

Contact Info

Product

Resources

About