A ground-complete axiomatisation of finite-state processes in a generic process algebra.
Jos C. M. BaetenMario BravettiPublished in: Math. Struct. Comput. Sci. (2008)
Keyphrases
- finite state
- model checking
- process algebra
- concurrent systems
- formal specification
- temporal logic
- markov chain
- transition systems
- concurrent programs
- markov decision processes
- formal methods
- completely independent
- asynchronous circuits
- tree automata
- finite state transducers
- process model
- software systems
- optimal policy
- search algorithm
- optimal solution
- artificial intelligence
- real time