Axiomatizing GSOS with termination

DOI10.1007/3-540-45841-7_48MaRDI QIDQ4736873zbMATH OpenFDO

Authors Erik de Vink, Jos C. M. Baeten

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850583.htm, https://pure.tue.nl/ws/files/1784322/200113469.pdf

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Axiomatizing GSOS with termination
• scientific article; zbMATH DE number 7318985
• Term rewriting properties of SOS axiomatisations
• SOS formats and meta-theory: 20 years after
• Rational operational models

Cited in

(9)

• CCS with Hennessy's merge has no finite-equational axiomatization
• Axiomatizing GSOS with termination
• Automating soundness proofs
• Exploiting algebraic laws to improve mechanized axiomatizations
• Abstract GSOS rules and a modular treatment of recursive definitions
• A Terminating Evaluation-Driven Variant of G3i
• Term rewriting properties of SOS axiomatisations
• scientific article; zbMATH DE number 7318985 (Why is no real title available?)
• A syntactic commutativity format for SOS

This page was built for publication: Axiomatizing GSOS with termination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736873)