MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability.
Shiguang FengClaudia CarapelleOliver Fernández GilKarin QuaasPublished in: ACM Trans. Comput. Log. (2020)
Keyphrases
- model checking
- bounded model checking
- temporal logic
- satisfiability problem
- model checker
- formal verification
- temporal properties
- finite state
- automated verification
- symbolic model checking
- partial order reduction
- verification method
- finite state machines
- expressive power
- formal specification
- formal methods
- computation tree logic
- reachability analysis
- epistemic logic
- timed automata
- np complete
- process algebra
- artificial intelligence
- linear temporal logic
- concurrent systems
- modal logic
- decision procedures
- transition systems
- state space
- np hard
- deterministic finite automaton
- phase transition