{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:17:44Z","timestamp":1725517064692},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853602"},{"type":"electronic","value":"9783540853619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85361-9_35","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T12:28:04Z","timestamp":1219062484000},"page":"447-461","source":"Crossref","is-referenced-by-count":17,"title":["A Rule Format for Associativity"],"prefix":"10.1007","author":[{"given":"Sjoerd","family":"Cranen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MohammadReza","family":"Mousavi","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":"35_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., Verhoef, C.: Structural Operational Semantics. In: Handbook of Process Algebra, ch. 3, pp. 197\u2013292. Elsevier, Amsterdam (2001)"},{"key":"35_CR2","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Mode transfer in process algebra. Technical Report CSR-00-01, Dept. of Computer Science, TU\/Eindhoven (2000)"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/3-540-57208-2_33","volume-title":"CONCUR\u201993","author":"J.C.M. Baeten","year":"1993","unstructured":"Baeten, J.C.M., Verhoef, C.: A congruence theorem for structured operational semantics with predicates. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 477\u2013492. Springer, Heidelberg (1993)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge (1990)","DOI":"10.1017\/CBO9780511624193"},{"issue":"5","key":"35_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. J. ACM\u00a043(5), 863\u2013914 (1996)","journal-title":"J. ACM"},{"key":"35_CR6","first-page":"171","volume-title":"Proc. of Protocol Specification, Testing and Verification V","author":"E. Brinksma","year":"1985","unstructured":"Brinksma, E.: A tutorial on LOTOS. In: Proc. of Protocol Specification, Testing and Verification V, pp. 171\u2013194. North-Holland, Amsterdam (1985)"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"de Simone, R.: Higher-level synchronizing devices in MEIJE-SCCS. TCS\u00a037, 245\u2013267 (1985)","journal-title":"TCS"},{"key":"35_CR8","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\u201399. Elsevier, Amsterdam (2001)"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78499-9_18","volume-title":"Foundations of Software Science and Computational Structures","author":"I. Hasuo","year":"2008","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: The microcosm principle and concurrency in coalgebra. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962. Springer, Heidelberg (to appear, 2008)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"A.J.R.G. Milner","year":"1980","unstructured":"Milner, A.J.R.G.: A Calculus of Communicating Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ipl.2004.11.007","volume":"93","author":"M.R. Mousavi","year":"2005","unstructured":"Mousavi, M.R., Reniers, M.A., Groote, J.F.: A syntactic commutativity format for SOS. IPL\u00a093, 217\u2013223 (2005)","journal-title":"IPL"},{"issue":"1","key":"35_CR13","first-page":"107","volume":"200","author":"M.R. Mousavi","year":"2005","unstructured":"Mousavi, M.R., Reniers, M.A., Groote, J.F.: Notions of bisimulation and congruence formats for SOS with data. I&C\u00a0200(1), 107\u2013147 (2005)","journal-title":"I&C"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. TCS (373), 238\u2013272 (2007)","DOI":"10.1016\/j.tcs.2006.12.019"},{"key":"35_CR15","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":"35_CR16","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1997","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)"},{"issue":"2","key":"35_CR17","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 2008 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85361-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T11:47:31Z","timestamp":1557748051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85361-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540853602","9783540853619"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85361-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}