The cones and foci proof technique for timed transition systems

DOI10.1016/S0020-0190(01)00215-0zbMath1003.68092OpenAlexW2054935966MaRDI QIDQ1607115

Mark B. van der Zwaag

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00215-0

zbMATH Keywords

timed transition systemstimed-branching bisimilarity of states

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Focus points and convergent process operators: A proof strategy for protocol verification

Cites Work

• A timed model for communicating sequential processes
• The tree identify protocol of IEEE 1394 in \(\mu\)CRL
• Formal verification of a leader election protocol in process algebra
• Discrete time process algebra
• Real time process algebra
• Process algebra for synchronous communication
• Branching time and abstraction in bisimulation semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The cones and foci proof technique for timed transition systems