{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:28:53Z","timestamp":1726406933095},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_31","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T23:48:02Z","timestamp":1164671282000},"page":"333-344","source":"Crossref","is-referenced-by-count":0,"title":["The Meaning of Ordered SOS"],"prefix":"10.1007","author":[{"given":"MohammadReza","family":"Mousavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iain","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel A.","family":"Reniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irek","family":"Ulidowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-1986-9202","volume":"XI","author":"J.C.M. Baeten","year":"1986","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae\u00a0XI(2), 127\u2013168 (1986)","journal-title":"Fundamenta Informaticae"},{"issue":"2&3","key":"31_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(89)90006-6","volume":"67","author":"J.C.M. Baeten","year":"1989","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W., Weijland, W.P.: Term-rewriting systems with rule priorities. TCS\u00a067(2&3), 283\u2013301 (1989)","journal-title":"TCS"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation Can\u2019t Be Traced. JACM\u00a042(1), 232\u2013268 (1995)","journal-title":"JACM"},{"issue":"5","key":"31_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"},{"key":"31_CR5","first-page":"229","volume":"60-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"},{"issue":"2","key":"31_CR6","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":"31_CR7","first-page":"221","volume":"117","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Regan, T.: A process algebra for timed systems. I&C\u00a0117(2), 221\u2013239 (1995)","journal-title":"I&C"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-31982-5_4","volume-title":"Foundations of Software Science and Computational Structures","author":"R. Lanotte","year":"2005","unstructured":"Lanotte, R., Tini, S.: Probabilistic congruence for semistochastic generative processes. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 63\u201378. Springer, Heidelberg (2005)"},{"issue":"1","key":"31_CR9","first-page":"180","volume":"178","author":"I. Ulidowski","year":"2002","unstructured":"Ulidowski, I., Phillips, I.C.C.: Ordered SOS Rules and Process Languages for Branching and Eager Bisimulations. I&C\u00a0178(1), 180\u2013213 (2002)","journal-title":"I&C"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T01:23:22Z","timestamp":1628126602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11944836_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}