Divide and congruence: from decomposition of modalities to preservation of branching bisimulation

Authors:
Wan Fokkink;Rob van Glabbeek;Paulien de Wind
Affiliations:
Section Theoretical Computer Science, Vrije Universiteit Amsterdam, Amsterdam;National ICT Australia, Sydney;Section Theoretical Computer Science, Vrije Universiteit Amsterdam, Amsterdam
Venue:
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Year:
2005

Citing 14
Cited 2

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Structured operational semantics and bisimulation as a congruence

Information and Computation
Transition system specifications with negative premises

Theoretical Computer Science
Bisimulation can't be traced

Journal of the ACM (JACM)
Three logics for branching bisimulation

Journal of the ACM (JACM)
Structural operational semantics for weak bisimulations

Theoretical Computer Science
Ntyft/ntyxt rules reduce to ntree rules

Information and Computation
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
The meaning of negative premises in transition system specifications

Journal of the ACM (JACM)
Rooted branching bisimulation as a congruence

Journal of Computer and System Sciences
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Precongruence formats for decorated trace semantics

ACM Transactions on Computational Logic (TOCL)
Compositionality of Hennessy-Milner logic by structural operational semantics

Theoretical Computer Science - Foundations of computation theory (FCT 2003)
On cool congruence formats for weak bisimulations

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing

Notes on Generative Probabilistic Bisimulation

Electronic Notes in Theoretical Computer Science (ENTCS)
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method to derive congruence formats for branching and rooted branching bisimulation equivalence.