New up-to techniques for weak bisimulation

DOI10.1016/j.tcs.2007.02.060zbMath1118.68095OpenAlexW1973506584MaRDI QIDQ2373744

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

terminationcommutationup-to techniquesweak bisimilarity

Mathematics Subject Classification ID

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

Related Items (6)

Confluence by Decreasing Diagrams ⋮ Unnamed Item ⋮ Unique solutions of contractions, CCS, and their HOL formalisation ⋮ Up-to Techniques for Branching Bisimilarity ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ (Bi)simulations up-to characterise process semantics

Uses Software

• Coq

Cites Work

• Diagram techniques for confluence
• An efficiency preorder for processes
• On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
• On the bisimulation proof method
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

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