Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
Petr JancarPublished in: Log. Methods Comput. Sci. (2012)
Keyphrases
- process algebra
- formal specification
- concurrent systems
- model checking
- asynchronous circuits
- formal methods
- description logics
- web services composition
- upper bound
- communication protocols
- concurrent programs
- grid workflow
- temporal logic
- theorem prover
- petri net
- first order logic
- reverse engineering
- knowledge base
- information systems
- fine grained
- distributed systems
- relational databases
- expert systems
- web services