Nested Semantics over Finite Trees are Equationally Hard

Luca Aceto; Willem Jan Fokkink; Rob J. van Glabbeek; Anna Ingólfsdóttir

doi:10.7146/brics.v10i27.21795

Nested Semantics over Finite Trees are Equationally Hard

Authors

Luca Aceto
Willem Jan Fokkink
Rob J. van Glabbeek
Anna Ingólfsdóttir

DOI:

https://doi.org/10.7146/brics.v10i27.21795

Abstract

This 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.

Downloads

Published

2003-08-07

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