Automatic generation of path conditions for concurrent timed systems
DOI10.1016/J.TCS.2008.03.012zbMath1293.68201OpenAlexW2104257809MaRDI QIDQ947796
Stavros Tripakis, Saddek Bensalem, Hongyang Qu, Doron A. Peled
Publication date: 7 October 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.012
partial orderdifference-bound matricestest case generationextended timed automatatimed transition systemspath condition
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Weakest precondition semantics for time and concurrency
- A theory of timed automata
- Symbolic model checking for real-time systems
- Temporal proof methodologies for timed transition systems
- Linear parametric model checking of timed automata
- On a routing problem
- Guarded commands, nondeterminacy and formal derivation of programs
- Verification: Theory and Practice
- A Theorem on Boolean Matrices
This page was built for publication: Automatic generation of path conditions for concurrent timed systems