On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt
DOI:
https://doi.org/10.7146/brics.v14i5.21928Resumé
We study Basic Process Algebra with interrupt modulo complete trace equivalence. We show that, unlike in the setting of the more demanding bisimilarity, a ground complete finite axiomatization exists. We explicitly give such an axiomatization, and extend it to a finite complete one in the special case when a single action is present.Downloads
Publiceret
2007-02-12
Citation/Eksport
Aceto, L., Capobianco, S., & Ingólfsdóttir, A. (2007). On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt. BRICS Report Series, 14(5). https://doi.org/10.7146/brics.v14i5.21928
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).