DMCA
A finite equational base for CCS with left merge and communication merge (2006)
Cached
Download Links
- [www.cs.vu.nl]
- [arxiv.org]
- [alexandria.tue.nl]
- [www.win.tue.nl]
- [www.win.tue.nl]
- [www.brics.dk]
- [www.brics.dk]
- DBLP
Other Repositories/Bibliography
by
Luca Aceto
,
Wan Fokkink
,
Anna Ingolfsdottir
,
Bas Luttik
| Venue: | Proceedings of ICALP’06 (part II), volume 4052 of Lecture Notes in Computer Science |
| Citations: | 13 - 9 self |
BibTeX
@INPROCEEDINGS{Aceto06afinite,
author = {Luca Aceto and Wan Fokkink and Anna Ingolfsdottir and Bas Luttik},
title = {A finite equational base for CCS with left merge and communication merge},
booktitle = {Proceedings of ICALP’06 (part II), volume 4052 of Lecture Notes in Computer Science},
year = {2006},
pages = {492--503},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Using the left merge and communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabelling. Our equational base is finite if the set of actions is finite. 1
