{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:34Z","timestamp":1759638274448},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642342806"},{"type":"electronic","value":"9783642342813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34281-3_30","type":"book-chapter","created":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T14:38:09Z","timestamp":1351521489000},"page":"430-446","source":"Crossref","is-referenced-by-count":1,"title":["State Space c-Reductions of Concurrent Systems in Rewriting Logic"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Lluch Lafuente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Vandin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"799","DOI":"10.3390\/sym2020799","volume":"2","author":"T. Wahl","year":"2010","unstructured":"Wahl, T., Donaldson, A.F.: Replication and abstraction: Symmetry in automated formal verification. Symmetry\u00a02, 799\u2013847 (2010)","journal-title":"Symmetry"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-40903-8_5","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M. Hendriks","year":"2004","unstructured":"Hendriks, M., Behrmann, G., Larsen, K., Niebert, P., Vaandrager, F.: Adding Symmetry Reduction to Uppaal. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol.\u00a02791, pp. 46\u201359. Springer, Heidelberg (2004)"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/s100090200074","volume":"4","author":"D. Bosnacki","year":"2002","unstructured":"Bosnacki, D., Dams, D., Holenderski, L.: Symmetric SPIN. International Journal on Software Tools for Technology Transfer\u00a04, 92\u2013106 (2002)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a united model of concurrency. Theoretical Computer Science\u00a096, 73\u2013155 (1992)","journal-title":"Theoretical Computer Science"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude","author":"M. Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: All About Maude. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez, D.E.: Combining techniques to reduce state space and prove strong properties. In: WRLA. ENTCS, vol.\u00a0238(3), pp. 267\u2013280 (2009)","key":"30_CR6","DOI":"10.1016\/j.entcs.2009.05.024"},{"unstructured":"C-Reducer, \n                    \n                      http:\/\/sysma.lab.imtlucca.it\/tools\/c-reducer","key":"30_CR7"},{"unstructured":"Lluch Lafuente, A., Meseguer, J., Vandin, A.: State space c-reductions of concurrent systems in rewriting logic (2012), Full version, \n                    \n                      eprints.imtlucca.it\/1350","key":"30_CR8"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.jlap.2009.07.003","volume":"79","author":"J. Meseguer","year":"2010","unstructured":"Meseguer, J., Palomino, M., Mart\u00ed-Oliet, N.: Algebraic simulations. Journal of Logic and Algebraic Programming\u00a079, 103\u2013143 (2010)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/11784180_29","volume-title":"Algebraic Methodology and Software Technology","author":"A.F. Donaldson","year":"2006","unstructured":"Donaldson, A.F., Miller, A.: A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol.\u00a04019, pp. 374\u2013380. Springer, Heidelberg (2006)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/3-540-45251-6_30","volume-title":"FME 2001: Formal Methods for Increasing Software Productivity","author":"D. Bo\u0161na\u010dki","year":"2001","unstructured":"Bo\u0161na\u010dki, D., Dams, D., Holenderski, L.: A Heuristic for Symmetry Reductions with Scalarsets. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol.\u00a02021, pp. 518\u2013533. Springer, Heidelberg (2001)"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44829-2_16","volume-title":"Model Checking Software","author":"S. Eker","year":"2003","unstructured":"Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL Model Checker and Its Implementation. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol.\u00a02648, pp. 230\u2013234. Springer, Heidelberg (2003)"},{"unstructured":"The Maude Invariant Analyzer Tool (InvA), \n                    \n                      http:\/\/camilorocha.info\/software\/inva","key":"30_CR13"},{"key":"30_CR14","first-page":"1618","volume":"12","author":"M. Clavel","year":"2006","unstructured":"Clavel, M., Palomino, M., Riesco, A.: Introducing the ITP tool: a tutorial. Journal of Universal Computer Science\u00a012, 1618\u20131650 (2006)","journal-title":"Journal of Universal Computer Science"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-16310-4_6","volume-title":"Rewriting Logic and Its Applications","author":"F. Dur\u00e1n","year":"2010","unstructured":"Dur\u00e1n, F., Meseguer, J.: A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications. In: \u00d6lveczky, P.C. (ed.) WRLA 2010. LNCS, vol.\u00a06381, pp. 69\u201385. Springer, Heidelberg (2010)"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-22944-2_22","volume-title":"Algebra and Coalgebra in Computer Science","author":"C. Rocha","year":"2011","unstructured":"Rocha, C., Meseguer, J.: Proving Safety Properties of Rewrite Theories. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 314\u2013328. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Spermann, C., Leuschel, M.: ProB gets nauty: Effective symmetry reduction for B and Z models. In: TASE, pp. 15\u201322. IEEE Computer Society (2008)","key":"30_CR17","DOI":"10.1109\/TASE.2008.33"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-11811-1_18","volume-title":"Abstract State Machines, Alloy, B and Z","author":"E. Turner","year":"2010","unstructured":"Turner, E., Butler, M., Leuschel, M.: A Refinement-Based Correctness Proof of Symmetry Reduced Model Checking. In: Frappier, M., Gl\u00e4sser, U., Khurshid, S., Laleau, R., Reeves, S. (eds.) ABZ 2010. LNCS, vol.\u00a05977, pp. 231\u2013244. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Farzan, A., Meseguer, J.: Partial order reduction for rewriting semantics of programming languages. In: WRLA. ENTCS, vol.\u00a0176(4), pp. 61\u201378 (2007)","key":"30_CR19","DOI":"10.1016\/j.entcs.2007.06.008"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.tcs.2008.04.040","volume":"403","author":"J. Meseguer","year":"2008","unstructured":"Meseguer, J., Palomino, M., Mart\u00ed-Oliet, N.: Equational abstractions. Theoretical Computer Science\u00a0403, 239\u2013264 (2008)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34281-3_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:50:54Z","timestamp":1620118254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34281-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642342806","9783642342813"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34281-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}