Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Structured operational semantics and bisimulation as a congruence
Information and Computation
Turning SOS rules into equations
Information and Computation
Journal of the ACM (JACM)
Communication and Concurrency
A New Strategy for Proving omega-Completeness applied to Process Algebra
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Mathematical Structures in Computer Science
Nested semantics over finite trees are equationally hard
Information and Computation
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Possible futures, acceptances, refusals, and communicating processes
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
On the axiomatizability of ready traces, ready simulation, and failure traces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
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
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science (ENTCS)
On finite alphabets and infinite bases
Information and Computation
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
Ready to preorder: The case of weak process semantics
Information Processing Letters
A Cancellation Theorem for BCCSP
Fundamenta Informaticae
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
(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)
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
A Cancellation Theorem for BCCSP
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper contributes to the study of the equational theory of the semantics in van Glabbeek's linear time - branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of any behavioral congruence lying between ready simulation equivalence and partial traces equivalence from a complete (respectively, ground-complete) inequational axiomatization of its underlying precongruence--that is, of the precongruence whose kernel is the equivalence. The algorithm preserves finiteness of the axiomatization when the set of actions is finite.