Model checking processes specified in join-calculus algebra.
Slawomir P. MaludzinskiGrzegorz DobrowolskiPublished in: Comput. Sci. (2014)
Keyphrases
- model checking
- timed automata
- process algebra
- transition systems
- temporal logic
- model checker
- finite state
- partial order reduction
- temporal properties
- formal verification
- formal specification
- automated verification
- finite state machines
- reachability analysis
- verification method
- bounded model checking
- concurrent systems
- symbolic model checking
- pspace complete
- computation tree logic
- linear temporal logic
- asynchronous circuits
- formal methods
- linear time temporal logic
- reactive systems
- theorem prover
- deterministic finite automaton
- ordered binary decision diagrams
- epistemic logic
- communication protocols