Model checking memoryful linear-time logics over one-counter automata.
Stéphane DemriRanko LazicArnaud SangnierPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- model checking
- epistemic logic
- finite state
- timed automata
- finite state machines
- temporal logic
- coalition logic
- modal logic
- model checker
- formal verification
- formal specification
- reachability analysis
- automated verification
- tree automata
- expressive power
- finite automata
- bounded model checking
- computation tree logic
- decision procedures
- inference rules
- symbolic model checking
- temporal properties
- transition systems
- process algebra
- verification method
- pspace complete
- linear temporal logic
- cl pc
- reactive systems
- formal methods
- planning domains
- modal operators
- default logic
- markov chain
- mathematical theory