%0 Journal Article %1 groote_06_hierarchy %A Groote, Jan F. %A Mousavi, Mohammad R. %A Reniers, Michel A. %B Proceedings of the Second Workshop on Structural Operational Semantics (SOS 2005) %D 2006 %J Electronic Notes in Theoretical Computer Science %K 2006 sos %N 1 %P 3--25 %R 10.1016/j.entcs.2005.11.077 %T A Hierarchy of SOS Rule Formats %U http://dx.doi.org/10.1016/j.entcs.2005.11.077 %V 156 %X In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981. Also published in: Journal of Logic and Algebraic Programming 60-61 (2004) 17-140. Subsequently, the format of SOS rules became the object of study. Using so-called Transition System Specifications (TSS's) several authors syntactically restricted the format of rules and showed several useful properties about the semantics induced by any TSS adhering to the format. This has resulted in a line of research proposing several syntactical rule formats and associated meta-theorems. Properties that are guaranteed by such rule formats range from well-definedness of the operational semantics and compositionality of behavioral equivalences to security- and probability-related issues. In this paper, we provide an initial hierarchy of SOS rules formats and meta-theorems formulated around them.

@article{groote_06_hierarchy, abstract = {In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981. Also published in: Journal of Logic and Algebraic Programming 60-61 (2004) 17-140]. Subsequently, the format of SOS rules became the object of study. Using so-called Transition System Specifications (TSS's) several authors syntactically restricted the format of rules and showed several useful properties about the semantics induced by any TSS adhering to the format. This has resulted in a line of research proposing several syntactical rule formats and associated meta-theorems. Properties that are guaranteed by such rule formats range from well-definedness of the operational semantics and compositionality of behavioral equivalences to security- and probability-related issues. In this paper, we provide an initial hierarchy of SOS rules formats and meta-theorems formulated around them.}, added-at = {2009-02-11T20:57:03.000+0100}, author = {Groote, Jan F. and Mousavi, Mohammad R. and Reniers, Michel A.}, biburl = {https://www.bibsonomy.org/bibtex/2e3a17333f169b47501d36eb24deea2fb/leonardo}, booktitle = {Proceedings of the Second Workshop on Structural Operational Semantics (SOS 2005)}, citeulike-article-id = {875768}, doi = {10.1016/j.entcs.2005.11.077}, interhash = {2687fdfc757e8109f23f85dbeb21c0ac}, intrahash = {e3a17333f169b47501d36eb24deea2fb}, journal = {Electronic Notes in Theoretical Computer Science}, keywords = {2006 sos}, month = May, number = 1, pages = {3--25}, posted-at = {2006-09-27 19:04:07}, priority = {2}, timestamp = {2009-02-11T20:57:03.000+0100}, title = {A Hierarchy of SOS Rule Formats}, url = {http://dx.doi.org/10.1016/j.entcs.2005.11.077}, volume = 156, year = 2006 }