Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
From MaRDI portal
Publication:6589835
DOI10.1016/J.TCS.2024.114681MaRDI QIDQ6589835FDOQ6589835
Authors: C. A. Middelburg 
Publication date: 20 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
process algebrabranching bisimilarityfunctional correctnessdiscrete relative timingPAR protocolperformance property
Cites Work
- Title not available (Why is that?)
- TIC: a tImed calculus
- A process algebra for timed systems
- Real time process algebra
- Branching time and abstraction in bisimulation semantics
- Behavioural abstraction in TCCS
- Process Algebra
- The meaning of negative premises in transition system specifications. II
- Process algebra with timing
- Applications of Process Algebra
- Branching bisimilarity is an equivalence indeed!
- Rooted branching bisimulation as a congruence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
- Title not available (Why is that?)
- Action Abstraction in Timed Process Algebra
- Discrete time process algebra with abstraction
- Imperative process algebra with abstraction
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)
