Divide and Congruence Applied to eta-Bisimulation

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.

[1]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[2]  Bard Bloom,et al.  Structural Operational Semantics for Weak Bisimulations , 1995, Theor. Comput. Sci..

[3]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[4]  Wan Fokkink,et al.  Rooted Branching Bisimulation as a Congruence , 2000, J. Comput. Syst. Sci..

[5]  Jos C. M. Baeten,et al.  Another Look at Abstraction in Process Algebra (Extended Abstract) , 1987, ICALP.

[6]  Rob J. van Glabbeek,et al.  The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..

[7]  Rob J. van Glabbeek.  On Cool Congruence Formats for Weak Bisimulations , 2005, ICTAC.

[8]  Wan Fokkink,et al.  Compositionality of Hennessy-Milner logic by structural operational semantics , 2006, Theor. Comput. Sci..

[9]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[10]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[11]  R. V. Glabbeek.  The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR , 2007 .

[12]  Jos C. M. Baeten,et al.  Another look at abstraction in process algebra , 1987 .

[13]  R. V. Glabbeek.  The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

[14]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[15]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[16]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[17]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[18]  Wan Fokkink,et al.  Ntyft/Ntyxt Rules Reduce to Ntree Rules , 1996, Inf. Comput..

[19]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, Journal of Logic and Computation.

[20]  Wan Fokkink,et al.  Precongruence formats for decorated trace semantics , 2002, TOCL.

[21]  Jan Friso Groote,et al.  The meaning of negative premises in transition system specifications , 1991, JACM.

[22]  Gordon D. Plotkin,et al.  The origins of structural operational semantics , 2004, J. Log. Algebraic Methods Program..