On the proof method for bisimulation

DOI10.1007/3-540-60246-1_153MaRDI QIDQ3569037zbMATH OpenOpenAlexFDO

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

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)

Cited in

(11)

• Program constructions that are safe for bisimulation
• Decoding choice encodings
• Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
• A duality in proof systems for recursive type equality and for bisimulation equivalence on cyclic term graphs
• Up-to techniques for branching bisimilarity
• scientific article; zbMATH DE number 4022620 (Why is no real title available?)
• scientific article; zbMATH DE number 177532 (Why is no real title available?)
• scientific article; zbMATH DE number 2038740 (Why is no real title available?)
• A characterisation of open bisimilarity using an intuitionistic modal logic
• Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
• Constraints as processes

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)