Nested Semantics over Finite Trees are Equationally Hard (2003)
Cached
Download Links
- [boole.stanford.edu]
- [www.cs.vu.nl]
- [boole.stanford.edu]
- DBLP
Other Repositories/Bibliography
by
Luca Aceto
,
Wan Fokkink
,
Rob van Glabbeek
,
Anna Ingolfsdottir
| Citations: | 11 - 8 self |
BibTeX
@MISC{Aceto03nestedsemantics,
author = {Luca Aceto and Wan Fokkink and Rob van Glabbeek and Anna Ingolfsdottir},
title = {Nested Semantics over Finite Trees are Equationally Hard},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
