On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces

We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, then there exists a (sound and complete) finite equational axiomatization for the process algebra BCCSP modulo ready trace semantics. We prove that if the alphabet is infinite, then such an axiomatization does not exist. Furthermore, we present finite equational axiomatizations for BCCSP modulo ready simulation and failure trace semantics, for arbitrary sets of actions.

• Type: Conference
• Year: 2003
• Where: ICALP
• Authors: Stefan Blom, Wan Fokkink, Sumit Nain
• Keywords: ICALP 2003, Modulo Ready Trace, Ready Trace Semantics, Theoretical Computer Science, finite Equational Axiomatizations