Automatic generation of path conditions for concurrent timed systems
From MaRDI portal
Publication:947796
DOI10.1016/j.tcs.2008.03.012zbMath1293.68201MaRDI 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 order; difference-bound matrices; test case generation; extended timed automata; timed transition systems; path condition
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item