{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:58:06Z","timestamp":1762459086019},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401831"},{"type":"electronic","value":"9783642401848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_5","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"46-60","source":"Crossref","is-referenced-by-count":1,"title":["Modular Semantics for Transition System Specifications with Negative Premises"],"prefix":"10.1007","author":[{"given":"Martin","family":"Churchill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter D.","family":"Mosses","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Reza","family":"Mousavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","first-page":"291","volume":"22","author":"L. Aceto","year":"2012","unstructured":"Aceto, L., Cimini, M., Ing\u00f3lfsd\u00f3ttir, A.: Proving the validity of equations in GSOS languages using rule-matching bisimilarity. MSCS\u00a022(2), 291\u2013331 (2012)","journal-title":"MSCS"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Aceto, L., Fokkink, W.J., Verhoef, C.: Structural operational semantics. In: Handbook of Process Algebra, ch. 3, pp. 197\u2013292. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50021-7"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ipl.2008.09.002","volume":"109","author":"L. Aceto","year":"2008","unstructured":"Aceto, L., Ingolfsdottir, A.: On the expressibility of priority. Inf. Process. Lett.\u00a0109(1), 83\u201385 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"5_CR4","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":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/963927.963929","volume":"5","author":"B. Bloom","year":"2004","unstructured":"Bloom, B., Fokkink, W., van Glabbeek, R.J.: Precongruence formats for decorated trace semantics. ACM Trans. Comput. Logic\u00a05(1), 26\u201378 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"5","key":"5_CR6","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":"5_CR7","doi-asserted-by":"crossref","unstructured":"Churchill, M., Mosses, P.D.: Modular bisimulation theory for computations and values. In: Pfenning, F. (ed.) FOSSACS 2013. LNCS, vol.\u00a07794, pp. 97\u2013112. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-37075-5_7"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Clark, K.L.: Negation as failure. In: Proc. ADBT 1977, pp. 293\u2013322. Plemum Press (1978)","DOI":"10.1007\/978-1-4684-3384-5_11"},{"issue":"1","key":"5_CR9","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":"5_CR10","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":"5_CR11","unstructured":"van Glabbeek, R.J.: The meaning of negative premises in transition system specifications II. Tech. Report, Stanford (STAN-CS-TN-95-16) (1995)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: The meaning of negative premises in transition system specifications II. JLAP 60-61, 229\u2013258 (2004)","DOI":"10.1016\/j.jlap.2004.03.007"},{"issue":"2","key":"5_CR13","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":"5_CR14","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":"5_CR15","doi-asserted-by":"crossref","unstructured":"Mosses, P.D., Mousavi, M.R., Reniers, M.A.: Robustness of equations under operational extensions. In: Proc. EXPRESS 2010. EPTCS, vol.\u00a041, pp. 106\u2013120 (2010)","DOI":"10.4204\/EPTCS.41.8"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.tcs.2006.12.019","volume":"373","author":"M. Mousavi","year":"2007","unstructured":"Mousavi, M., Reniers, M.A., Groote, J.F.: SOS rule formats and meta-theory: 20 years after. TCS\u00a0373, 238\u2013272 (2007)","journal-title":"TCS"},{"key":"5_CR17","first-page":"17","volume":"60-61","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. JLAP 60-61, 17\u2013139 (2004)","journal-title":"JLAP"},{"key":"5_CR18","first-page":"345","volume":"156","author":"A. Rensink","year":"2000","unstructured":"Rensink, A.: Bisimilarity of open terms. I&C\u00a0156, 345\u2013385 (2000)","journal-title":"I&C"},{"key":"5_CR19","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"},{"issue":"2","key":"5_CR20","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. Nord. J. of Comp.\u00a02(2), 274\u2013302 (1995)","journal-title":"Nord. J. of Comp."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:45:03Z","timestamp":1557960303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}