A Specification Format for Rooted Branching Bisimulation

DOI10.3233/FI-2014-1128zbMath1315.68190OpenAlexW1541604516MaRDI QIDQ5259297

Valentina Castiglioni, Simone Tini, Ruggero Lanotte

Publication date: 26 June 2015

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-1128

zbMATH Keywords

weak equivalencerooted branching bisimulationspecification format

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity

This page was built for publication: A Specification Format for Rooted Branching Bisimulation