Is Timed Branching Bisimilarity an Equivalence Indeed? | Zendy

Wan Fokkink | Zendy; Jun Pang | Zendy; Anton Wijs | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Is Timed Branching Bisimilarity an Equivalence Indeed?

Author(s) -

Wan Fokkink,

Jun Pang,

Anton Wijs

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-30946-2

DOI - 10.1007/11603009_20

Subject(s) - equivalence (formal languages) , branching (polymer chemistry) , equivalence relation , computer science , logical equivalence , discrete mathematics , mathematics , materials science , composite material

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research