The cones and foci proof technique for timed transition systems
DOI10.1016/S0020-0190(01)00215-0zbMATH Open1003.68092OpenAlexW2054935966MaRDI QIDQ1607115FDOQ1607115
Authors: 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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Process algebra for synchronous communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A timed model for communicating sequential processes
- Real time process algebra
- Branching time and abstraction in bisimulation semantics
- Discrete time process algebra
- The tree identify protocol of IEEE 1394 in \(\mu\)CRL
- Formal verification of a leader election protocol in process algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: The cones and foci proof technique for timed transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607115)