Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis

DOI10.1016/j.tcs.2024.114681MaRDI QIDQ6589835

C. A. Middelburg

Publication date: 20 August 2024

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

zbMATH Keywords

process algebrabranching bisimilarityfunctional correctnessdiscrete relative timingPAR protocolperformance property

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
• TIC: a tImed calculus
• Branching bisimilarity is an equivalence indeed!
• Process algebra with timing
• The meaning of negative premises in transition system specifications. II
• A process algebra for timed systems
• Rooted branching bisimulation as a congruence
• Real time process algebra
• Action Abstraction in Timed Process Algebra
• Process Algebra
• Applications of Process Algebra
• Branching time and abstraction in bisimulation semantics
• Discrete time process algebra with abstraction
• Behavioural abstraction in TCCS
• Imperative process algebra with abstraction

This page was built for publication: Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis