Skip to main content
Conference Proceedings

A finite basis for failure semantics

Lecture Notes in Computer Science (2005) 3580 755-765
DOI: 10.1007/11523468_61
9Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

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]. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Fokkink, W., & Nain, S. (2005). A finite basis for failure semantics. In Lecture Notes in Computer Science (Vol. 3580, pp. 755–765). Springer Verlag. https://doi.org/10.1007/11523468_61

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free