Nested Semantics over Finite Trees are Equationally Hard

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

Nested Semantics over Finite Trees are Equationally Hard

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

Institut for Datalogi

Publikation: Working paper/Preprint › Working paper › Forskning

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

Originalsprog	Engelsk
Status	Udgivet - 2003

Adgang til dokumentet

http://www.brics.dk/NS/03/2/

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Citationsformater

@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",

}

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 -