Highly Undecidable Questions for Process Algebras

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F04%3A00010317" target="_blank" >RIV/61989100:27240/04:00010317 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Highly Undecidable Questions for Process Algebras
Original language description
We show $Sigma^1_1$-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 $Pi^1_1$-hardness of weak $omega$-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes).
Czech name
Highly Undecidable Questions for Process Algebras
Czech description
We show $Sigma^1_1$-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 $Pi^1_1$-hardness of weak $omega$-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes).

Project
<a href="/en/project/GA201%2F03%2F1161" target="_blank" >GA201/03/1161: Verification of infinite-state systems</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proc. of 3rd IFIP Intern. Conf. on Theoretical Computer Science (TCS'04)
ISBN
1-4020-8156-1
ISSN
—
e-ISSN
—
Number of pages
14
Pages from-to
507-520
Publisher name
Kluwer Academic Publishers
Place of publication
Dordrecht
Event location
Toulouse, France
Event date
Jan 1, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)