On the proof method for bisimulation

DOI10.1007/3-540-60246-1_153zbMath1193.68177OpenAlexW1488482916MaRDI QIDQ3569037

Davide Sangiorgi

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60246-1_153

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) 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 (6)

Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ Constraints as processes ⋮ Up-to Techniques for Branching Bisimilarity ⋮ Deriving Bisimulation Congruences in the Presence of Negative Application Conditions ⋮ Unnamed Item ⋮ Decoding choice encodings

This page was built for publication: On the proof method for bisimulation