TY - JOUR
T1 - Nested semantics over finite trees are equationally hard
AU - Aceto, L.
AU - Fokkink, W.J.
AU - van Glabbeek, R.J.
AU - Ingólfsdóttir, A.
N1 - DBLP:journals/iandc/AcetoFGI04
PY - 2004
Y1 - 2004
N2 - 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. © 2004 Elsevier Inc. All rights reserved.
AB - 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. © 2004 Elsevier Inc. All rights reserved.
UR - https://www.scopus.com/pages/publications/2942625706
UR - https://www.scopus.com/inward/citedby.url?scp=2942625706&partnerID=8YFLogxK
U2 - 10.1016/j.ic.2004.02.001
DO - 10.1016/j.ic.2004.02.001
M3 - Article
SN - 0890-5401
VL - 191
SP - 203
EP - 232
JO - Information and Computation
JF - Information and Computation
IS - 2
ER -
