Nested Semantics over Finite Trees are Equationally Hard

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

Publikation: Working paper/PreprintWorking paperForskning

Abstrakt

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

Citationsformater