On the proof method for bisimulation
DOI10.1007/3-540-60246-1_153zbMATH Open1193.68177OpenAlexW1488482916MaRDI QIDQ3569037FDOQ3569037
Authors: 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
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)
Cited In (11)
- Up-to techniques for branching bisimilarity
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
- Constraints as processes
- Program constructions that are safe for bisimulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decoding choice encodings
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
- A duality in proof systems for recursive type equality and for bisimulation equivalence on cyclic term graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On the proof method for bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569037)
