On well-foundedness and expressiveness of promoted tyft (being promoted makes a difference)

DOI10.1016/J.ENTCS.2006.09.015zbMATH Open1277.68125OpenAlexW2150711875WikidataQ57745712 ScholiaQ57745712MaRDI QIDQ2866315FDOQ2866315

Mohammad Mousavi, Michel A. Reniers

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.09.015

zbMATH Keywords

structural operational semantics (SOS)promoted tyftSOS rule formats

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• Structured operational semantics and bisimulation as a congruence
• Structural operational semantics.
• Proving congruence of bisimulation in functional programming languages
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• A theory of higher order communicating systems
• CONCUR 2005 – Concurrency Theory
• A hierarchy of SOS rule formats

Cited In (1)

• SOS formats and meta-theory: 20 years after

This page was built for publication: On well-foundedness and expressiveness of promoted tyft (being promoted makes a difference)

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