{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:58:19Z","timestamp":1725544699989},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642116223"},{"type":"electronic","value":"9783642116230"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11623-0_8","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T01:08:29Z","timestamp":1264381709000},"page":"146-161","source":"Crossref","is-referenced-by-count":3,"title":["Rule Formats for Determinism and Idempotence"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[]},{"given":"Arnar","family":"Birgisson","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Ingolfsdottir","sequence":"additional","affiliation":[]},{"given":"MohammadReza","family":"Mousavi","sequence":"additional","affiliation":[]},{"given":"Michel A.","family":"Reniers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/B978-044482830-9\/50021-7","volume-title":"Handbook of Process Algebra","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)"},{"key":"8_CR2","series-title":"EATCS Monographs","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04995-2","volume-title":"Process Algebra with Timing","author":"J.C.M. Baeten","year":"2002","unstructured":"Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. EATCS Monographs. Springer, Berlin (2002)"},{"key":"8_CR3","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","volume-title":"Process Algebra","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol.\u00a018. Cambridge University Press, Cambridge (1990)"},{"key":"8_CR4","series-title":"IFIP Conference Proceedings","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-0-387-34878-0_27","volume-title":"Proceedings of Formal Description Techniques","author":"J.C.M. Baeten","year":"1995","unstructured":"Baeten, J.C.M., Mauw, S.: Delayed choice: An operator for joining Message Sequence Charts. In: Proceedings of Formal Description Techniques. IFIP Conference Proceedings, vol.\u00a06, pp. 340\u2013354. Chapman & Hall, Boca Raton (1995)"},{"issue":"1-3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control\u00a060(1-3), 109\u2013137 (1984)","journal-title":"Information and Control"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-540-85361-9_35","volume-title":"CONCUR 2008 - Concurrency Theory","author":"S. Cranen","year":"2008","unstructured":"Cranen, S., Mousavi, M.R., Reniers, M.A.: A rule format for associativity. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 447\u2013461. Springer, Heidelberg (2008)"},{"key":"8_CR7","unstructured":"D\u2019Argenio, P.R.: \u03c4-angelic choice for process algebras (revised version). Technical report, LIFIA, Depto. de Inform\u00e1tica, Fac. de Cs. Exactas, Universidad Nacional de La Plata (1995)"},{"issue":"6-7","key":"8_CR8","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00236-003-0111-1","volume":"39","author":"W.J. Fokkink","year":"2003","unstructured":"Fokkink, W.J., Duong Vu, T.: Structural operational semantics and bounded nondeterminism. Acta Informatica\u00a039(6-7), 501\u2013516 (2003)","journal-title":"Acta Informatica"},{"issue":"2","key":"8_CR9","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. Theoretical Computer Science\u00a0118(2), 263\u2013299 (1993)","journal-title":"Theoretical Computer Science"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","first-page":"233","volume-title":"Advances in Petri Nets 1987","author":"M. Hennessy","year":"1987","unstructured":"Hennessy, M., Plotkin, G.D.: Finite conjuncitve nondeterminism. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol.\u00a0266, pp. 233\u2013244. Springer, Heidelberg (1987)"},{"key":"8_CR11","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ic.2007.11.008","volume":"207","author":"M.R. Mousavi","year":"2009","unstructured":"Mousavi, M.R., Phillips, I.C.C., Reniers, M.A., Ulidowski, I.: Semantics and expressiveness of ordered SOS. Information and Computation\u00a0207(2), 85\u2013119 (2009)","journal-title":"Information and Computation"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1007\/11523468_98","volume-title":"Automata, Languages and Programming","author":"M.R. Mousavi","year":"2005","unstructured":"Mousavi, M.R., Reniers, M.A.: Orthogonal extensions in structural operational semantics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1214\u20131225. Springer, Heidelberg (2005)"},{"key":"8_CR15","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. Information Processing Letters\u00a093, 217\u2013223 (2005)","journal-title":"Information Processing Letters"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theoretical Computer Science\u00a0(373), 238\u2013272 (2007)","DOI":"10.1016\/j.tcs.2006.12.019"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1994.1083","volume":"114","author":"X. Nicollin","year":"1994","unstructured":"Nicollin, X., Sifakis, J.: The algebra of timed processes ATP: Theory and application. Information and Computation\u00a0114(1), 131\u2013178 (1994)","journal-title":"Information and Computation"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","volume":"60","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Progamming\u00a060, 17\u2013139 (2004); This article first appeared as Technical Report DAIMI FN-19, Computer Science Department, Aarhus University","journal-title":"Journal of Logic and Algebraic Progamming"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.jlap.2004.03.003","volume":"60","author":"S. Tini","year":"2004","unstructured":"Tini, S.: Rule formats for compositional non-interference properties. Journal of Logic and Algebraic Progamming\u00a060, 353\u2013400 (2004)","journal-title":"Journal of Logic and Algebraic Progamming"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.jlap.2004.03.002","volume":"60","author":"I. Ulidowski","year":"2004","unstructured":"Ulidowski, I., Yuen, S.: Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation. Journal of Logic and Algebraic Progamming\u00a060, 401\u2013460 (2004)","journal-title":"Journal of Logic and Algebraic Progamming"},{"key":"8_CR21","unstructured":"van Weerdenburg, M., Reniers, M.A.: Structural operational semantics with first-order logic. In: Pre-proceedings of SOS 2008, pp. 48\u201362 (2008)"},{"issue":"2","key":"8_CR22","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","Fundamentals of Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11623-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T18:42:28Z","timestamp":1634755348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11623-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642116223","9783642116230"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11623-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}