A finite basis for failure semantics (2005)
by
Wan Fokkink
,
Sumit Nain
| Venue: | In Proceedings 32nd Colloquium on Automata, Languages and Programming (ICALP’05), Lisbon, LNCS 3580 |
| Citations: | 6 - 5 self |
BibTeX
@INPROCEEDINGS{Fokkink05afinite,
author = {Wan Fokkink and Sumit Nain},
title = {A finite basis for failure semantics},
booktitle = {In Proceedings 32nd Colloquium on Automata, Languages and Programming (ICALP’05), Lisbon, LNCS 3580},
year = {2005},
pages = {755--765},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Groote [12]. 1
