Branching bisimilarity for processes with time-outs

DOI10.4230/LIPICS.CONCUR.2024.36MaRDI QIDQ6859911zbMATH OpenFDO

Authors Gaspard Reghem, Rob van Glabbeek

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2024.36

zbMATH Keywords

axiomatisationbranching bisimilaritycongruencemodal characterisationreactive systemstime-outs

Mathematics Subject Classification ID

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

Cites work

• A calculus of communicating systems
• A complete proof system for 1-free regular expressions modulo bisimilarity
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Branching bisimilarity for processes with time-outs
• Branching time and abstraction in bisimulation semantics
• CADP 2010: a toolbox for the construction and analysis of distributed processes
• Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations.
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• Failure trace semantics for a process algebra with time-outs
• scientific article; zbMATH DE number 1412988 (Why is no real title available?)
• Lean and full congruence formats for recursion
• Modelling mutual exclusion in a process algebra with time-outs
• Process Algebra
• Reactive bisimulation semantics for a process algebra with timeouts
• Specification-oriented semantics for communicating processes

Cited in

(1)

• Branching bisimilarity for processes with time-outs

This page was built for publication: Branching bisimilarity for processes with time-outs

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