{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:18:28Z","timestamp":1725560308509},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_25","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:54:50Z","timestamp":1127829290000},"page":"308-322","source":"Crossref","is-referenced-by-count":5,"title":["SOS for Higher Order Processes"],"prefix":"10.1007","author":[{"given":"MohammadReza","family":"Mousavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murdoch J.","family":"Gabbay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel A.","family":"Reniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_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 Science, Amsterdam (2001)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BFb0035846","volume-title":"Proc. of STACS 1988","author":"E. Astesiano","year":"1988","unstructured":"Astesiano, E., Giovini, A., Reggio, G.: Generalized bisimulation in relational specifications. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol.\u00a0294, pp. 207\u2013226. Springer, Heidelberg (1988)"},{"key":"25_CR3","first-page":"153","volume-title":"Proc. of LICS 1998","author":"K.L. Bernstein","year":"1998","unstructured":"Bernstein, K.L.: A congruence theorem for structured operational semantics of higher-order languages. In: Proc. of LICS 1998, pp. 153\u2013164. IEEE CS, Los Alamitos (1998)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(94)00152-9","volume":"146","author":"B. Bloom","year":"1995","unstructured":"Bloom, B.: Structural operational semantics for weak bisimulations. TCS\u00a0146, 25\u201368 (1995)","journal-title":"TCS"},{"issue":"5","key":"25_CR5","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"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-50939-9_130","volume-title":"TAPSOFT 1989. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989","author":"G. Boudol","year":"1989","unstructured":"Boudol, G.: Towards a lambda-calculus for concurrent and communicating systems. In: D\u00edaz, J., Orejas, F. (eds.) CAAP 1989 and TAPSOFT 1989. LNCS, vol.\u00a0351, pp. 149\u2013161. Springer, Heidelberg (1989)"},{"issue":"1","key":"25_CR7","first-page":"1","volume":"126","author":"W.J. Fokkink","year":"1996","unstructured":"Fokkink, W.J., van Glabbeek, R.J.: Ntyft\/ntyxt rules reduce to ntree rules. I&C\u00a0126(1), 1\u201310 (1996)","journal-title":"I&C"},{"issue":"1","key":"25_CR8","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":"25_CR9","first-page":"139","volume-title":"Proc. of LICS 2004","author":"M.J. Gabbay","year":"2004","unstructured":"Gabbay, M.J., Cheney, J.: A Sequent Calculus for Nominal Logic. In: Proc. of LICS 2004, pp. 139\u2013148. IEEE CS, Los Alamitos (2004)"},{"issue":"1-3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(03)00129-4","volume":"309","author":"V. Galpin","year":"2003","unstructured":"Galpin, V.: A format for semantic equivalence comparison. TCS\u00a0309(1-3), 65\u2013109 (2003)","journal-title":"TCS"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching Time and Abstraction in Bisimulation Semantics. JACM\u00a043(3), 555\u2013600 (1996)","journal-title":"JACM"},{"issue":"2","key":"25_CR12","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"},{"issue":"2","key":"25_CR13","first-page":"202","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"Groote, J.F., Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. I&C\u00a0100(2), 202\u2013260 (1992)","journal-title":"I&C"},{"key":"25_CR14","first-page":"103","volume":"124","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. I&C\u00a0124, 103\u2013112 (1996)","journal-title":"I&C"},{"issue":"1","key":"25_CR15","first-page":"15","volume":"47","author":"C.A. Middelburg","year":"2001","unstructured":"Middelburg, C.A.: Variable binding operators in transition system specifications. JLAP\u00a047(1), 15\u201345 (2001)","journal-title":"JLAP"},{"issue":"2","key":"25_CR16","first-page":"165","volume":"186","author":"A.M. Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. I&C\u00a0186(2), 165\u2013193 (2003)","journal-title":"I&C"},{"key":"25_CR17","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":"25_CR18","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/263699.263760","volume-title":"Proc. of POPL 1997","author":"D. Sands","year":"1997","unstructured":"Sands, D.: From SOS rules to proof principles: An operational metatheory for functional languages. In: Proc. of POPL 1997, pp. 428\u2013441. ACM Press, New York (1997)"},{"issue":"1","key":"25_CR19","first-page":"120","volume":"111","author":"D. Sangiorgi","year":"1994","unstructured":"Sangiorgi, D.: The Lazy lambda calculus in a concurrency scenario. I&C\u00a0111(1), 120\u2013153 (1994)","journal-title":"I&C"},{"issue":"2","key":"25_CR20","first-page":"141","volume":"131","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Bisimulation for Higher-Order Process Calculi. I&C\u00a0131(2), 141\u2013178 (1996)","journal-title":"I&C"},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01200262","volume":"30","author":"B. Thomsen","year":"1993","unstructured":"Thomsen, B.: Plain CHOCS a second generation calculus for higher order processes. Acta Informatica\u00a030(1), 1\u201359 (1993)","journal-title":"Acta Informatica"},{"key":"25_CR22","first-page":"38","volume":"116","author":"B. Thomsen","year":"1995","unstructured":"Thomsen, B.: A theory of higher order communicating systems. I&C\u00a0116, 38\u201357 (1995)","journal-title":"I&C"},{"issue":"2","key":"25_CR23","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"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T11:40:54Z","timestamp":1538826054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11539452_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}