A complete axiomatization of weighted branching bisimulation

DOI10.1007/s00236-020-00375-6zbMath1448.68343OpenAlexW3021686541MaRDI QIDQ2182679

Mathias Claus Jensen, Kim Guldstrand Larsen

Publication date: 26 May 2020

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-020-00375-6

Mathematics Subject Classification ID

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

Cites Work

• A complete inference system for a class of regular behaviours
• A calculus of communicating systems
• A complete axiomatisation for observational congruence of finite-state behaviours
• Branching bisimilarity is an equivalence indeed!
• Weighted branching systems: behavioural equivalence, behavioural distance, and their logical characterisations
• The Exact Path Length Problem
• Algebraic laws for nondeterminism and concurrency
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete axiomatization of weighted branching bisimulation