Nested Semantics over Finite Trees are Equationally Hard
AbstractThis paper studies nested simulation and nested trace semantics over the language BCCSP, a basic formalism to express finite process behaviour. It is shown that none of these semantics affords finite (in)equational axiomatizations over BCCSP. In particular, for each of the nested semantics studied in this paper, the collection of sound, closed (in)equations over a singleton action set is not finitely based.
How to Cite
Aceto, L., Fokkink, W. J., Glabbeek, R. J. van, & Ingólfsdóttir, A. (2003). Nested Semantics over Finite Trees are Equationally Hard. BRICS Report Series, 10(27). https://doi.org/10.7146/brics.v10i27.21795
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.