Finite-state concurrent programs can be expressed in pairwise normal form.
Paul C. AttiePublished in: Theor. Comput. Sci. (2016)
Keyphrases
- asynchronous circuits
- finite state
- normal form
- process algebra
- concurrent programs
- model checking
- pairwise
- temporal logic
- markov chain
- relational databases
- database design
- functional dependencies
- markov decision processes
- relational algebra
- nested relations
- formal specification
- similarity measure
- integrity constraints
- set of functional dependencies
- databases
- optimal policy
- general purpose