Conference ProceedingsOPEN ACCESS

Highly undecidable questions for process algebras

IFIP Advances in Information and Communication Technology (2004) 155 507-520
DOI: 10.1007/1-4020-8141-3_39
5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show Σ11-completeness of weak bisimilarity for PA (process algebra), and of weak simulation preorder/equivalence for PDA (pushdown automata), PA and PN (Petri nets). We also show Π11-hardness of weak ω-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes). © 2004 Springer Science + Business Media, Inc.

Author supplied keywords

Cite

CITATION STYLE

APA

Jančar, P., & Srba, J. (2004). Highly undecidable questions for process algebras. In IFIP Advances in Information and Communication Technology (Vol. 155, pp. 507–520). Springer New York LLC. https://doi.org/10.1007/1-4020-8141-3_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free