Nested Semantics over Finite Trees are Equationally Hard

Luca Aceto, W. J. Fokkink, R. J. van Glabeek, Anna Ingolfsdottir

Publikation: Working paperForskning

Resumé

This note collects some of the author's favourite results in classic process algebra, broadly construed, and points to some open problems in the field. It is hoped that this piece will offer a modest contribution to the healthy development of this area of research
OriginalsprogEngelsk
StatusUdgivet - 2003

Citer dette

Aceto, L., Fokkink, W. J., van Glabeek, R. J., & Ingolfsdottir, A. (2003). Nested Semantics over Finite Trees are Equationally Hard.
Aceto, Luca ; Fokkink, W. J. ; van Glabeek, R. J. ; Ingolfsdottir, Anna. / Nested Semantics over Finite Trees are Equationally Hard. 2003.
@techreport{3bef95209c2d11db8ed6000ea68e967b,
title = "Nested Semantics over Finite Trees are Equationally Hard",
abstract = "This note collects some of the author's favourite results in classic process algebra, broadly construed, and points to some open problems in the field. It is hoped that this piece will offer a modest contribution to the healthy development of this area of research",
author = "Luca Aceto and Fokkink, {W. J.} and {van Glabeek}, {R. J.} and Anna Ingolfsdottir",
year = "2003",
language = "English",
type = "WorkingPaper",

}

Aceto, L, Fokkink, WJ, van Glabeek, RJ & Ingolfsdottir, A 2003 'Nested Semantics over Finite Trees are Equationally Hard'.

Nested Semantics over Finite Trees are Equationally Hard. / Aceto, Luca; Fokkink, W. J.; van Glabeek, R. J.; Ingolfsdottir, Anna.

2003.

Publikation: Working paperForskning

TY - UNPB

T1 - Nested Semantics over Finite Trees are Equationally Hard

AU - Aceto, Luca

AU - Fokkink, W. J.

AU - van Glabeek, R. J.

AU - Ingolfsdottir, Anna

PY - 2003

Y1 - 2003

N2 - This note collects some of the author's favourite results in classic process algebra, broadly construed, and points to some open problems in the field. It is hoped that this piece will offer a modest contribution to the healthy development of this area of research

AB - This note collects some of the author's favourite results in classic process algebra, broadly construed, and points to some open problems in the field. It is hoped that this piece will offer a modest contribution to the healthy development of this area of research

M3 - Working paper

BT - Nested Semantics over Finite Trees are Equationally Hard

ER -

Aceto L, Fokkink WJ, van Glabeek RJ, Ingolfsdottir A. Nested Semantics over Finite Trees are Equationally Hard. 2003.