Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Information and Computation
Bisimulation through probabilistic testing
Information and Computation
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Turning SOS rules into equations
Information and Computation
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Impossible futures and determinism
Information Processing Letters
Communication and Concurrency
Refusal Simulation and Interactive Games
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A New Strategy for Proving omega-Completeness applied to Process Algebra
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Axiomatisations of Weak Equivalences for De Simone Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
On finite alphabets and infinite bases
Information and Computation
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic (TOCL)
Ready to preorder: The case of weak process semantics
Information Processing Letters
(Bi)simulations up-to characterise process semantics
Information and Computation
On the Unification of Process Semantics: Equational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Process Algebra: Equational Theories of Communicating Processes
Process Algebra: Equational Theories of Communicating Processes
Ready to preorder: get your BCCSP axiomatization for free!
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Ready simulation for concurrency: It's logical!
Information and Computation
Information Processing Letters
A characterisation of weak bisimulation congruence
Processes, Terms and Cycles
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
The equational theory of weak complete simulation semantics over BCCSP
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its original definition by Bloom, Istrail and Meyer in 1995, several authors have proposed generalizations of ready simulation to deal with internal actions. However, a thorough study of the (non-)existence of finite (in)equational bases for weak ready simulation semantics is still missing in the literature. This paper presents a complete account of positive and negative results on the axiomatizability of weak ready simulation semantics over the language BCCSP. In addition, this study offers a thorough analysis of the axiomatizability properties of weak simulation semantics.