Model checking memoryful linear-time logics over one-counter automata
Stéphane DemriRanko LazicArnaud SangnierPublished in: CoRR (2008)
Keyphrases
- model checking
- epistemic logic
- finite state
- timed automata
- finite state machines
- temporal logic
- coalition logic
- modal logic
- formal verification
- automated verification
- formal specification
- expressive power
- temporal properties
- model checker
- formal methods
- cl pc
- pspace complete
- finite automata
- computation tree logic
- tree automata
- concurrent systems
- process algebra
- bounded model checking
- verification method
- symbolic model checking
- satisfiability problem
- transition systems
- linear temporal logic
- reachability analysis
- regular expressions
- asynchronous circuits
- inference rules
- planning domains