On the complexity of equation solving in process algebra
Number of Authors: 2
1991 (English)Report (Refereed)
The problem of designing a system which in a given environment C should satisfy a given specification S can be formulated as "find a system P such that C(P) satisfies the specification S". In process algebra, such problems take the form of equations. We investigate the complexity of solving such equations in process algebra. We consider the problem of deciding whether there is a process P which satisfies an equation of one of the following forms : (the complete form could not be translated) where C is an arbitrary context of some process Algebra, A, B and Q are given processes, S is a modal specification, () is (weak) bisimulation equivalence, is refinement between modal specifications (a generalization of bisimulation equivalence), and | and \L is the parallel and restriction operator of CCS respectively. The main result is that all four problems are PSPACE-hard in the size of the given contexts, processes and specifications. The four problems are still PSPACE-hard if the right-hand side of the equations is required to be deterministic and the number of involved actions is bounded by a small constant. We also give constraints under which the first and third problem can be solved in polynomial time.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1991, 1. , 26 p.
SICS Research Report, ISSN 0283-3638 ; R91:05
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22171OAI: oai:DiVA.org:ri-22171DiVA: diva2:1041714
Revised and extended version of a paper that will appear under the same title in the Proceedings of the Colloquium on Trees and Algebra in Programming, Brighton, England, April, 1991, published in Lecture Notes in Computer Science by Springer Verlag.2016-10-312016-10-31Bibliographically approved