{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:55:54Z","timestamp":1725584154652},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212536"},{"type":"electronic","value":"9783642212543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21254-3_5","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T05:38:04Z","timestamp":1306474684000},"page":"80-91","source":"Crossref","is-referenced-by-count":3,"title":["Rule Formats for Distributivity"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Cimini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ingolfsdottir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Reza","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":"5_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., Cimini, M., Ingolfsdottir, A., Mousavi, M.R., Reniers, M.A.: Rule formats for distributivity. Technical Report CSR-10-16, TU\/Eindhoven (2010)","DOI":"10.1007\/978-3-642-21254-3_5"},{"key":"5_CR2","first-page":"81","volume":"99","author":"L. Aceto","year":"2009","unstructured":"Aceto, L., Ingolfsdottir, A., Mousavi, M.R., Reniers, M.A.: Algebraic properties for free! Bulletin of the European Association for Theoretical Computer Science\u00a099, 81\u2013104 (2009); Columns: Concurrency","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-11623-0_8","volume-title":"Fundamentals of Software Engineering","author":"L. Aceto","year":"2010","unstructured":"Aceto, L., Birgisson, A., Ingolfsdottir, A., Mousavi, M.R., Reniers, M.A.: Rule formats for determinism and idempotence. In: Arbab, F., Sirjani, M. (eds.) FSEN 2009. LNCS, vol.\u00a05961, pp. 146\u2013161. Springer, Heidelberg (2010)"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1040","volume":"111","author":"L. Aceto","year":"1994","unstructured":"Aceto, L., Bloom, B., Vaandrager, F.W.: Turning SOS rules into equations. Inf. Comput.\u00a0111(1), 1\u201352 (1994)","journal-title":"Inf. Comput."},{"key":"5_CR5","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"145","volume-title":"Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVI)","author":"L. Aceto","year":"2010","unstructured":"Aceto, L., Cimini, M., Ingolfsdottir, A., Mousavi, M.R., Reniers, M.A.: On rule formats for zero and unit elements. In: Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVI), Ottawa, Canada. Electronic Notes in Theoretical Computer Science, vol.\u00a0265, pp. 145\u2013160. Elsevier B.V., The Netherlands (2010)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/11601548_18","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"L. Aceto","year":"2005","unstructured":"Aceto, L., Fokkink, W., Ingolfsdottir, A., Luttik, B.: Finite equational bases in process algebra: Results and open questions. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 338\u2013367. Springer, Heidelberg (2005)"},{"key":"5_CR7","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., Verhoef, C.: Structural operational semantics. In: Handbook of Process Algebra, pp. 197\u2013292. Elsevier, Amsterdam (2001)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-11266-9_12","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"L. Aceto","year":"2010","unstructured":"Aceto, L., Ingolfsdottir, A., Mousavi, M.R., Reniers, M.A.: Rule formats for unit elements. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol.\u00a05901, pp. 141\u2013152. Springer, Heidelberg (2010)"},{"key":"5_CR9","unstructured":"Baeten, J., Bergstra, J.: Mode transfer in process algebra. Technical Report Report CSR 00\u201301, Eindhoven University of Technology (2000)"},{"issue":"2","key":"5_CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-1986-9202","volume":"IX","author":"J. Baeten","year":"1986","unstructured":"Baeten, J., Bergstra, J., Klop, J.W.: Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae\u00a0IX(2), 127\u2013168 (1986)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR11","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195003","volume-title":"Process Algebra: Equational Theories of Communicating Processes","author":"J. Baeten","year":"2009","unstructured":"Baeten, J., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science, vol.\u00a050. Cambridge University Press, Cambridge (2009)"},{"key":"5_CR12","series-title":"IFIP Conference Proceedings","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-0-387-34878-0_27","volume-title":"Formal Description Techniques VII, Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques","author":"J. Baeten","year":"1995","unstructured":"Baeten, J., Mauw, S.: Delayed choice: An operator for joining Message Sequence Charts. In: Hogrefe, D., Leue, S. (eds.) Formal Description Techniques VII, Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques, Berne, Switzerland. IFIP Conference Proceedings, vol.\u00a06, pp. 340\u2013354. Chapman & Hall, Boca Raton (1995)"},{"key":"5_CR13","unstructured":"Bergstra, J., Klop, J.W.: Fixed point semantics in process algebras. Report IW 206, Mathematisch Centrum, Amsterdam (1982)"},{"key":"5_CR14","first-page":"171","volume-title":"Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V","author":"E. Brinksma","year":"1985","unstructured":"Brinksma, E.: A tutorial on LOTOS. In: Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V, pp. 171\u2013194. North-Holland Publishing Co., Amsterdam (1985)"},{"key":"5_CR15","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":"5_CR16","volume-title":"Communicating Sequential Processes","author":"C. Hoare","year":"1985","unstructured":"Hoare, C.: Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs (1985)"},{"key":"5_CR17","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Inc., Upper Saddle River (1989)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/BFb0032072","volume-title":"Automata, Languages and Programming","author":"F. Moller","year":"1990","unstructured":"Moller, F.: The importance of the left merge operator in process algebras. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 752\u2013764. Springer, Heidelberg (1990)"},{"key":"5_CR19","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"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.tcs.2006.12.019","volume":"373","author":"M.R. Mousavi","year":"2007","unstructured":"Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theor. Comput. Sci.\u00a0373(3), 238\u2013272 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR21","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":"5_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.03.009","volume":"60-61","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebr. Program.\u00a060-61, 17\u2013139 (2004)","journal-title":"J. Log. Algebr. Program."},{"issue":"4","key":"5_CR23","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T. Przymusinski","year":"1990","unstructured":"Przymusinski, T.: The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae\u00a013(4), 445\u2013463 (1990)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21254-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T02:51:14Z","timestamp":1637722274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}