Is timed branching bisimilarity an equivalence indeed?

Authors:
Wan Fokkink;Jun Pang;Anton Wijs
Affiliations:
Department of Theoretical Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands;INRIA Futurs and LIX, École Polytechnique, Palaiseau, France;Department of Software Engineering, CWI, Amsterdam, The Netherlands
Venue:
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Year:
2005

Citing 9
Cited 7

Branching bisimilarity is an equivalence indeed!

Information Processing Letters
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
The cones and foci proof technique for timed transition systems

Information Processing Letters
Process Algebra with Timing

Process Algebra with Timing
Completeness of timed #CRL

Fundamenta Informaticae
The Silent Step in Time

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Abstraction in Real Time Process Algebra

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Formal Verification of Timed Systems Using Cones and Foci

Electronic Notes in Theoretical Computer Science (ENTCS)

Is Timed Branching Bisimilarity a Congruence Indeed?

Fundamenta Informaticae
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Action abstraction in timed process algebra: the case for an untimed silent step

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Unifying behavioral equivalences of timed transition systems

Programming and Computing Software
A categorical view of timed weak bisimulation

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Is Timed Branching Bisimilarity a Congruence Indeed?

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that timed branching bisimilarity as defined by van der Zwaag [14] and Baeten & Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, van der Zwaag’s definition and our adaptation coincide.