Abstract
The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that the trace equivalence remains undecidable even if the number of labels is restricted to two. The undecidability result holds also for the simulation of two-label BPP processes. These results imply undecidability of some behavioral type systems for the π-calculus. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Kobayashi, N., & Suto, T. (2007). Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 740–751). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
