Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity

DOI10.1016/j.ic.2008.06.001zbMath1169.68035OpenAlexW1994802992MaRDI QIDQ1004387

Zhaohui Zhu, Jinjin Zhang

Publication date: 4 March 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.06.001

zbMATH Keywords

approximate bisimilaritybranching distancequantitative transition systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Lattice-valued simulations for quantitative transition systems ⋮ A modal characterization of alternating approximate bisimilarity ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• Time-abstracted bisimulation: Implicit specifications and decidability
• Bisimulation indexes and their applications
• A behavioural pseudometric for probabilistic transition systems
• Approximation Metrics for Discrete and Continuous Systems
• A Behavioural Pseudometric based on λ–Bisimilarity
• Automata, Languages and Programming
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity