On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt
AbstractWe 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.
How to Cite
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
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.