Three partition refinement algorithms
SIAM Journal on Computing
Efficient parallel algorithms
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Complexity of equivalence problems for concurrent systems of finite agents
Information and Computation
Communication and Concurrency
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
On the Complexity of Deciding Behavioural Equivalences and Preorders
On the Complexity of Deciding Behavioural Equivalences and Preorders
A Parametric Analysis of the State Explosion Problem in Model Checking
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Why Is Simulation Harder than Bisimulation?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Component Simulation-based Substitutivity Managing QoS Aspects
Electronic Notes in Theoretical Computer Science (ENTCS)
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Complexity bounds for the verification of real-time software
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
A Connection Between Concurrency and Language Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidability of Weak Simulation on One-Counter Nets
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The paper shows a simple LOGSPACE-reduction from the boolean circuit value problem which demonstrates that, on finite labelled transition systems, deciding an arbitrary relation which subsumes bisimulation equivalence and is subsumed by trace preorder is a polynomial-time-hard problem (and thus can not be expected to be efficiently parallelizable). By this, the result of Balc谩zar, Gabarr贸 and S谩ntha (1992) for bisimilarity is substantially extended.