Divide and Congruence Applied to η-Bisimulation

Authors:
Wan Fokkink;Rob van Glabbeek;Paulien de Wind
Affiliations:
Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam and CWI, Department of Software Engineering, Amsterdam;National ICT Australia, Sydney and School of Computer Science and Engineering, Univ. of New South Wales, Sydney;Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 10
Cited 2

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Another look at abstraction in process algebra

14th International Colloquium on Automata, languages and programming
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)
Structural operational semantics for weak bisimulations

Theoretical Computer Science
Ntyft/ntyxt rules reduce to ntree rules

Information and Computation
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)

A Hierarchy of SOS Rule Formats

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 congruence formats for @h- and rooted @h-bisimulation equivalence. These formats are derived using a method for decomposing modal formulas in process algebra. 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.