Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity

Authors:
Wan Fokkink;Rob van Glabbeek;Paulien de Wind
Affiliations:
VU University Amsterdam, Department of Computer Science, Boelelaan 1081, 1081 HV Amsterdam, The Netherlands;National ICT Australia, Locked Bag 6016, Sydney, Australia and University of New South Wales, School of Computer Science and Engineering, Sydney, NSW 1466, Australia;VU University Amsterdam, Department of Computer Science, Boelelaan 1081, 1081 HV Amsterdam, The Netherlands
Venue:
Information and Computation
Year:
2012

Citing 23
Cited 0

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
Bounded nondeterminism and the approximation induction principle in process algebra

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Another look at abstraction in process algebra

14th International Colloquium on Automata, languages and programming
The well-founded semantics for general logic programs

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 bisimilarity is an equivalence indeed!

Information Processing Letters
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)
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Rooted branching bisimulation as a congruence

Journal of Computer and System Sciences
Communication and Concurrency

Communication and Concurrency
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Modal Characterisation of Observable Machine-Behaviour

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
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)
Divide and Congruence Applied to η-Bisimulation

Electronic Notes in Theoretical Computer Science (ENTCS)
Divide and congruence: from decomposition of modalities to preservation of branching bisimulation

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for decomposing modal formulas for processes with the internal action @t. 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 two weak and rooted weak semantics: branching and @h-bisimilarity.