Benutzer: Gast  Login
Wenn Sie Schwierigkeiten haben, das Dokument zu öffnen, versuchen Sie auch bitte diesen Link
Titel:

Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time

Dokumenttyp:
Technical Report
Autor(en):
Antonin Kucera; Richard Mayr
Abstract:
We prove that weak bisimilarity is decidable in polynomial time between BPA and finite-state processes, and between normed BPP and finite-state processes. To the best of our knowledge, these are the first polynomial algorithms for weak bisimilarity with infinite-state systems.
Stichworte:
concurrency; infinite-state systems; process algebras; verification; bisimulation
Jahr:
1998
Jahr / Monat:
1998-12-01 00:00:00
Seiten/Umfang:
30
 BibTeX