Process algebra
Turning SOS rules into equations
Information and Computation
Journal of the ACM (JACM)
The algebra of communicating processes with empty process
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Finite axiom systems for testing preorder and De Simone process languages
Theoretical Computer Science
Introduction to Process Algebra
Introduction to Process Algebra
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Axiomatisations of Weak Equivalences for De Simone Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science - Expressiveness in concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
A syntactic commutativity format for SOS
Information Processing Letters
The saga of the axiomatization of parallel composition
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
We discuss a combination of GSOS-type structural operational semantics with explicit termination, that we call the tagh-format (tagh being short for termination and GSOS hybrid).The tagh-format distinguishes between transition and termination rules, but allows besides active and negative premises as in GSOS, also for, what is called terminating and passive arguments. We extend the result of Aceto, Bloom and Vaandrager on the automatic generation of sound and complete axiomatizations for GSOS to the setting of tagh-transition system specifications. The construction of the equational theory is based upon the notion of a smooth and distinctive operation, which have been generalized from GSOS to tagh. The examples provided indicate a significant improvement over the mechanical axiomatization techniques known so far.