The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Communication and concurrency
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
The complexity of word problems—this time with interleaving
Information and Computation
Deciding true concurrency equivalences on safe, finite nets
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Complexity of equivalence problems for concurrent systems of finite agents
Information and Computation
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
On the Complexity of Relational Problems for Finite State Processes (Extended Abstract)
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Checking for CFFD-Preorder with Tester Processes
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
The State Explosion Problem from Trace to Bisimulation Equivalence
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Information Processing Letters
Hardness of preorder checking for basic formalisms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Hardness of preorder checking for basic formalisms
Theoretical Computer Science
Operational semantics for fun and profit
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 0.00 |
We study the complexity of verification problems in which a preorder relation between an implementation and a specification is checked, when the specification is given as a parallel composition of processes. This problem turns out to be PSPACE- or EXPSPACE complete, depending on the type of the parallel composition operator that is used in the construction of the specification. This implies that confusion with different parallel composition operators may lead to erroneous complexity claims. We fix one such erroneous result presented in an earlier publication. We also show that the application of hiding, renaming or just one interleaving parallel composition operation to a specification for which the problem is in PSPACE, may raise the complexity of the problem to EXPSPACE-hard.