Checking That Finite State Concurrent Programs Satisfy Their Linear Specification.
Orna LichtensteinAmir PnueliPublished in: POPL (1985)
Keyphrases
- finite state
- concurrent programs
- process algebra
- model checking
- transition systems
- markov chain
- formal specification
- markov decision processes
- concurrent systems
- temporal logic
- optimal policy
- asynchronous circuits
- formal methods
- tree automata
- context free
- high level
- partially observable markov decision processes
- dynamic programming
- concurrent programming
- average cost
- policy iteration
- reinforcement learning