Enhancements of the bisimulation proof method

DOI10.1017/CBO9780511792588.007zbMath1285.68111OpenAlexW1495872178MaRDI QIDQ5412011

Davide Sangiorgi, Damien Pous

Publication date: 25 April 2014

Published in: Advanced Topics in Bisimulation and Coinduction (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/cbo9780511792588.007

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Proving soundness of extensional normal-form bisimilarities, Latticed \(k\)-induction with an application to probabilistic programs, Diacritical companions, Algorithms for Kleene algebra with converse, Structural congruence for bialgebraic semantics, Unnamed Item, Extracting Proofs from Tabled Proof Search, Parameterizing higher-order processes on names and processes, Proving language inclusion and equivalence by coinduction, Unnamed Item, Enhanced coalgebraic bisimulation, Reasoning about multi-stage programs, Unnamed Item, Up-to Techniques for Branching Bisimilarity, Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity, Up-To Techniques for Weighted Systems, A general account of coinduction up-to, Automata Learning: A Categorical Perspective, Compositional Coinduction with Sized Types, Unnamed Item, Unnamed Item, Bisimulation and coinduction enhancements: a historical perspective, Towards `up to context' reasoning about higher-order processes, Unnamed Item, Equations, Contractions, and Unique Solutions, Unnamed Item, Mechanized metatheory revisited, Unnamed Item, Unnamed Item