On the axiomatizability of ready traces, ready simulation, and failure traces

Authors:
Stefan Blom;Wan Fokkink;Sumit Nain
Affiliations:
CWI, Department of Software Engineering, Amsterdam, The Netherlands;CWI, Department of Software Engineering, Amsterdam, The Netherlands and Vrije Universiteit Amsterdam, Department of Theoretical Computer Science, Amsterdam, The Netherlands;IIT Delhi, Department of Computer Science and Engineering, New Delhi, India
Venue:
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Year:
2003

Citing 8
Cited 11

Refusal testing

Theoretical Computer Science
Ready-trace semantics for concrete process algebra with the priority operator

The Computer Journal
A new strategy for proving &ohgr;-completeness applied to process algebra

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing

Information and Computation
Structured operational semantics and bisimulation as a congruence

Information and Computation
Bisimulation can't be traced

Journal of the ACM (JACM)
Linear and Branching Structures in the Semantics and Logics of Reactive Systems

Proceedings of the 12th Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science

Nested semantics over finite trees are equationally hard

Information and Computation
Bisimilarity is not finitely based over BPA with interrupt

Theoretical Computer Science - Algebra and coalgebra in computer science
A Cancellation Theorem for BCCSP

Fundamenta Informaticae
(Bi)simulations up-to characterise process semantics

Information and Computation
Ready to preorder: get your BCCSP axiomatization for free!

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On finite alphabets and infinite bases II: completed and ready simulation

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A finite basis for failure semantics

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Bisimilarity is not finitely based over BPA with interrupt

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
On finite alphabets and infinite bases III: simulation

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Finite equational bases in process algebra: results and open questions

Processes, Terms and Cycles
A Cancellation Theorem for BCCSP

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.