@inproceedings{b73e66c217d34eeabb2a88c3d8bbad07,
title = "A complete finite prefix for process algebra",
abstract = "In this paper we show how to use McMillan{\textquoteright}s complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model. We present a simple adequate order (using an order on process algebra expressions) as an optimization to McMillan{\textquoteright}s original algorithm",
author = "E. Brinksma and R. Langerak",
year = "1999",
doi = "10.1007/3-540-48683-6_18",
language = "English",
isbn = "3-540-66202-2",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "184--195",
editor = "N. Halbwachs and D. Peled",
booktitle = "Computer aided verification : proceedings 11th international conference, CAV '99, Trento, Italy, july 6-10, 1999",
address = "Germany",
}