SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata.
Janusz MalinowskiPeter NiebertPublished in: TACAS (2010)
Keyphrases
- bounded model checking
- partial order
- model checking
- timed automata
- epistemic logic
- temporal logic
- formal verification
- partially ordered
- total order
- conceptual graphs
- linear temporal logic
- preference relations
- logical formulas
- logic programming
- modal logic
- sequential patterns
- transition systems
- cooperative
- planning domains
- cp nets
- theorem prover
- state space