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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Blom, S., Fokkink, W., & Nain, S. (2003). On the axiomatizability of ready traces, ready simulation, and failure traces. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2719, 109–118. https://doi.org/10.1007/3-540-45061-0_10
Mendeley helps you to discover research relevant for your work.