Model-checking CTL* over flat Presburger counter systems.
Stéphane DemriAlain FinkelValentin GorankoGovert van DrimmelenPublished in: J. Appl. Non Class. Logics (2010)
Keyphrases
- model checking
- temporal logic
- automated verification
- finite state machines
- formal methods
- temporal properties
- computation tree logic
- formal verification
- artifact centric
- finite state
- bounded model checking
- transition systems
- formal specification
- model checker
- reactive systems
- verification method
- symbolic model checking
- linear temporal logic
- epistemic logic
- pspace complete
- reachability analysis
- concurrent systems
- process algebra
- timed automata
- modal logic
- asynchronous circuits
- alternating time temporal logic
- temporal epistemic
- software engineering
- specification language
- satisfiability problem
- markov decision processes
- distributed systems
- description logics