CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Undecidable equivalences for basic process algebra
Information and Computation
On deciding readiness and failure equivalences for processes
Information and Computation
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
Communication and Concurrency
Undecidable Equivalences for Basic Parallel Processes
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Petri Nets and the Equivalence Problem
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Computation: finite and infinite machines
Computation: finite and infinite machines
Possible futures, acceptances, refusals, and communicating processes
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Space-efficient scheduling of stochastically generated tasks
Information and Computation
| Hi-index | 0.00 |
The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that all the preorders and equivalences except bisimulation in Glabbeek's linear time-branching time spectrum are undecidable for BPP. The results are obtained by extending Hirshfeld's encoding of Minsky machines into BPP. We also show that those preorders and equivalences are undecidable even for a restriction of BPP to 2-labels.