New up-to techniques for weak bisimulation

DOI10.1016/J.TCS.2007.02.060zbMATH Open1118.68095OpenAlexW1973506584MaRDI QIDQ2373744FDOQ2373744

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

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
• Publication:4941915
• Enhancements of the bisimulation proof method
• Towards weak bisimulation for coalgebras

zbMATH Keywords

terminationcommutationup-to techniquesweak bisimilarity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the bisimulation proof method
• The \(\pi\)-calculus: A theory of mobile processes
• Title not available (Why is that?)
• An efficiency preorder for processes
• Diagram techniques for confluence
• Automata, Languages and Programming
• On Bisimulation Proofs for the Analysis of Distributed Abstract Machines

Cited In (19)

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

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)