A Finite Basis for Failure Semantics

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].

• Type: Conference
• Year: 2005
• Where: ICALP
• Authors: Wan Fokkink, Sumit Nain
• Keywords: ICALP 2005, Modulo Failure Semantics, Open Question, Theoretical Computer Science, finite ω-complete Axiomatization