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

DOI10.1016/J.TCS.2024.114681MaRDI QIDQ6589835zbMATH OpenFDO

Authors 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

• scientific article; zbMATH DE number 1678357 (Why is no real title available?)
• scientific article; zbMATH DE number 3958712 (Why is no real title available?)
• scientific article; zbMATH DE number 497653 (Why is no real title available?)
• scientific article; zbMATH DE number 1092328 (Why is no real title available?)
• scientific article; zbMATH DE number 1531624 (Why is no real title available?)
• A process algebra for timed systems
• Action Abstraction in Timed Process Algebra
• Applications of Process Algebra
• Behavioural abstraction in TCCS
• Branching bisimilarity is an equivalence indeed!
• Branching time and abstraction in bisimulation semantics
• Discrete time process algebra with abstraction
• Imperative process algebra with abstraction
• Process Algebra
• Process algebra with timing
• Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
• Real time process algebra
• Rooted branching bisimulation as a congruence
• TIC: a tImed calculus
• The meaning of negative premises in transition system specifications. II

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

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