Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds
DOI:
https://doi.org/10.7146/brics.v9i16.21734Resumé
In this paper we study bisimilarity problems for simple process algebras. In particular, we show PSPACE-hardness of the following problems:- strong bisimilarity of Basic Parallel Processes (BPP),
- strong bisimilarity of Basic Process Algebra (BPA),
- strong regularity of BPP, and
- strong regularity of BPA.
Bisimilarity problems for simple process algebras are introduced in a general framework of process rewrite systems, and a uniform description of the new techniques used for the hardness proofs is provided.
Downloads
Publiceret
2002-04-05
Citation/Eksport
Srba, J. (2002). Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds. BRICS Report Series, 9(16). https://doi.org/10.7146/brics.v9i16.21734
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).