New up-to techniques for weak bisimulation

DOI10.1016/J.TCS.2007.02.060MaRDI QIDQ2373744zbMATH OpenOpenAlexFDO

Authors Damien Pous

Publication date 16 July 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.02.060

zbMATH Keywords

commutationterminationup-to techniquesweak bisimilarity

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• Weak Bisimulation Up to Elaboration
• Weak Bisimulation Approximants
• Beyond Bisimulation: The “up-to” Techniques
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Computing maximal weak and other bisimulations
• scientific article; zbMATH DE number 1418352
• Enhancements of the bisimulation proof method
• Towards weak bisimulation for coalgebras

Cites work

• An efficiency preorder for processes
• Automata, Languages and Programming
• Diagram techniques for confluence
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 2090726 (Why is no real title available?)
• On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
• On the bisimulation proof method
• The -calculus: A theory of mobile processes

Cited in

(22)

• (Bi)simulations up-to characterise process semantics
• Congruent weak bisimulation with dense real-time
• Diacritical companions
• Unique solutions of contractions, CCS, and their HOL formalisation
• Bisimulation and coinduction enhancements: a historical perspective
• Coalgebraic bisimulation-up-to
• Bisimulations up-to: beyond first-order transition systems
• Up-to techniques for branching bisimilarity
• Unique solutions of contractions, CCS, and their HOL formalisation
• Confluence by Decreasing Diagrams
• Beyond Bisimulation: The “up-to” Techniques
• Up-to techniques for generalized bisimulation metrics
• A general account of coinduction up-to
• Lax bialgebras and up-to techniques for weak bisimulations
• On cool congruence formats for weak bisimulations
• Automata, Languages and Programming
• Weak Bisimulation Up to Elaboration
• Bisimulation verification using the up to techniques
• Preorder-constrained simulations for program refinement with effects
• Breadth-first fuzzy bisimulations for fuzzy automata
• Nondeterministic asynchronous dataflow in Isabelle/HOL
• Using bisimulation proof techniques for the analysis of distributed abstract machines

Describes a project that uses

Uses Software

• Coq

This page was built for publication: New up-to techniques for weak bisimulation

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