A specification format for rooted branching bisimulation

DOI10.3233/FI-2014-1128zbMATH Open1315.68190OpenAlexW1541604516MaRDI QIDQ5259297FDOQ5259297

Authors: Valentina Castiglioni, Ruggero Lanotte, Simone Tini 

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

Recommendations

• Rooted branching bisimulation as a congruence
• Structured operational semantics and bisimulation as a congruence
• A Rule Format for Associativity
• Rule formats for bounded nondeterminism in structural operational semantics
• SOS formats and meta-theory: 20 years after

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)

Cited In (4)

• Raiders of the lost equivalence: probabilistic branching bisimilarity
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
• A Rule Format for Associativity
• Next-preserving branching bisimulation

This page was built for publication: A specification format for rooted branching bisimulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259297)