{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:33:35Z","timestamp":1761597215689},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_98","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"1214-1225","source":"Crossref","is-referenced-by-count":8,"title":["Orthogonal Extensions in Structural Operational Semantics"],"prefix":"10.1007","author":[{"given":"MohammadReza","family":"Mousavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel A.","family":"Reniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"98_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/B978-044482830-9\/50021-7","volume-title":"Handbook of Process Algebra, ch. 3","author":"L. Aceto","year":"2001","unstructured":"Aceto, L., Fokkink, W.J., Verhoef, C.: Structural operational semantics. In: Handbook of Process Algebra, ch. 3, pp. 197\u2013292. Elsevier, Amsterdam (2001)"},{"issue":"4","key":"98_CR2","first-page":"589","volume":"13","author":"J.C.M. Baeten","year":"2003","unstructured":"Baeten, J.C.M.: Embedding untimed into timed timed process algebra: the case for explicit termination. MSCS\u00a013(4), 589\u2013618 (2003)","journal-title":"MSCS"},{"key":"98_CR3","first-page":"149","volume-title":"Handbook of Logic in Computer Science","author":"J.C.M. Baeten","year":"1995","unstructured":"Baeten, J.C.M., Verhoef, C.: Concrete Process Algebra. In: Handbook of Logic in Computer Science, vol.\u00a04, pp. 149\u2013268. Oxford University Press, Oxford (1995)"},{"issue":"5","key":"98_CR4","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1145\/234752.234756","volume":"43","author":"R. Bol","year":"1996","unstructured":"Bol, R., Groote, J.F.: The meaning of negative premises in transition system specifications. JACM\u00a043(5), 863\u2013914 (1996)","journal-title":"JACM"},{"issue":"1","key":"98_CR5","first-page":"24","volume":"146","author":"W.J. Fokkink","year":"1998","unstructured":"Fokkink, W.J., Verhoef, C.: A conservative look at operational semantics with variable binding. I&C\u00a0146(1), 24\u201354 (1998)","journal-title":"I&C"},{"key":"98_CR6","first-page":"229","volume":"61","author":"R.J. Glabbeek van","year":"2004","unstructured":"van Glabbeek, R.J.: The meaning of negative premises in transition system specifications II. JLAP\u00a060-61, 229\u2013258 (2004)","journal-title":"JLAP"},{"key":"98_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra, ch. 1","author":"R.J. Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum I. In: Handbook of Process Algebra, ch. 1, pp. 3\u2013100. Elsevier, Amsterdam (2001)"},{"issue":"2","key":"98_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"J.F. Groote","year":"1993","unstructured":"Groote, J.F.: Transition system specifications with negative premises. TCS\u00a0118(2), 263\u2013299 (1993)","journal-title":"TCS"},{"key":"98_CR9","first-page":"87","volume-title":"Proceedings of FORTE 1992","author":"G. Leduc","year":"1993","unstructured":"Leduc, G., Leonard, L.: A timed LOTOS supporting a dense time domain and including new timed operators. In: Proceedings of FORTE 1992, pp. 87\u2013102. North-Holland, Amsterdam (1993)"},{"issue":"1\/2","key":"98_CR10","first-page":"1","volume":"55","author":"C.A. Middelburg","year":"2003","unstructured":"Middelburg, C.A.: An alternative formulation of operational conservativity with binding terms. JLAP\u00a055(1\/2), 1\u201319 (2003)","journal-title":"JLAP"},{"key":"98_CR11","doi-asserted-by":"crossref","unstructured":"Mousavi, M.R., Reniers, M.A.: Orthogonal Extensions in Structural Operational Semantics. Technical Report, Dept. of Computer Science, Eindhoven Univ. of Tech. (2005)","DOI":"10.1007\/11523468_98"},{"key":"98_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M. Park","year":"1981","unstructured":"Park, D.M.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"98_CR13","first-page":"17","volume":"60","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. JLAP\u00a060, 17\u2013139 (2004)","journal-title":"JLAP"},{"key":"98_CR14","unstructured":"Vereijken, J.J.: Discrete Time Process Algebra. PhD thesis, Department of Computer Science, Eindhoven University of Technology (1997)"},{"key":"98_CR15","first-page":"274","volume-title":"Proceedings of PROCOMET 1994","author":"C. Verhoef","year":"1994","unstructured":"Verhoef, C.: A general conservative extension theorem in process algebra. In: Proceedings of PROCOMET 1994, pp. 274\u2013302. Elsevier, Amsterdam (1994)"},{"issue":"2","key":"98_CR16","first-page":"274","volume":"2","author":"C. Verhoef","year":"1995","unstructured":"Verhoef, C.: A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing\u00a02(2), 274\u2013302 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"98_CR17","first-page":"110","volume":"69","author":"C. Verhoef","year":"1999","unstructured":"Verhoef, C., Aceto, L., Fokkink, W.: Conservative extension in structural operational semantics. BEATCS\u00a069, 110\u2013132 (1999)","journal-title":"BEATCS"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:23Z","timestamp":1605643583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11523468_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}