Nested Semantics over Finite Trees are Equationally Hard

Luca Aceto, Willem Jan Fokkink, Rob J. van Glabbeek, Anna Ingólfsdóttir
2003 BRICS Report Series  
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.
doi:10.7146/brics.v10i27.21795 fatcat:7swwfzjc6bdgjcmacz6wtvb5d4