{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:50:33Z","timestamp":1725580233973},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642203978"},{"type":"electronic","value":"9783642203985"}],"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-20398-5_19","type":"book-chapter","created":{"date-parts":[[2011,4,6]],"date-time":"2011-04-06T19:29:49Z","timestamp":1302118189000},"page":"252-266","source":"Crossref","is-referenced-by-count":1,"title":["Symmetry for the Analysis of Dynamic Systems"],"prefix":"10.1007","author":[{"given":"Zarrin","family":"Langari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Trefler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","volume":"22","author":"K. Apt","year":"1986","unstructured":"Apt, K., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. Information Processing Letters\u00a022, 307\u2013309 (1986)","journal-title":"Information Processing Letters"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-28644-8_6","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P. Baldan","year":"2004","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: Verifying finite-state graph grammars: an unfolding-based approach. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 83\u201398. Springer, Heidelberg (2004)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45832-8_30","volume-title":"Graph Transformation","author":"L. Baresi","year":"2002","unstructured":"Baresi, L., Heckel, R.: Tutorial introduction to graph transformation: A software engineering perspective. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 402\u2013429. Springer, Heidelberg (2002)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-02658-4_9","volume-title":"Computer Aided Verification","author":"G. Basler","year":"2009","unstructured":"Basler, G., Mazzucchi, M., Wahl, T., Kroening, D.: Symbolic counter abstraction for concurrent software. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 64\u201378. Springer, Heidelberg (2009)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Becker, B., Beyer, D., Giese, H., Klein, F., Schilling, D.: Symbolic invariant verification for systems with dynamic structural adaptation. In: ICSE 2006, pp. 72\u201381 (2006)","DOI":"10.1145\/1134285.1134297"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 403\u2013418. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF00625969","volume":"9","author":"E.M. Clarke","year":"1996","unstructured":"Clarke, E.M., Enders, R., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. Form. Methods in Sys. Des.\u00a09(1-2), 77\u2013104 (1996)","journal-title":"Form. Methods in Sys. Des."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/23005.24038","volume":"34","author":"P. Degano","year":"1987","unstructured":"Degano, P., Montanari, U.: A model for distributed systems based on graph rewriting. J. ACM\u00a034(2), 411\u2013449 (1987)","journal-title":"J. ACM"},{"issue":"1\/2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E.A. Emerson","year":"1996","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and model checking. Form. Methods Syst. Des.\u00a09(1\/2), 105\u2013131 (1996)","journal-title":"Form. Methods Syst. Des."},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-48153-2_12","volume-title":"Correct Hardware Design and Verification Methods","author":"E.A. Emerson","year":"1999","unstructured":"Emerson, E.A., Trefler, R.J.: From asymmetry to full symmetry: New techniques for symmetry reduction in model checking. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.\u00a01703, pp. 142\u2013157. Springer, Heidelberg (1999)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BFb0053588","volume-title":"Fundamental Approaches to Software Engineering","author":"R. Heckel","year":"1998","unstructured":"Heckel, R.: Compositional verification of reactive systems specified by graph transformation. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol.\u00a01382, p. 138. Springer, Heidelberg (1998)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-46017-9_5","volume-title":"Model Checking Software","author":"R. Iosif","year":"2002","unstructured":"Iosif, R.: Symmetry reduction criteria for software model checking. In: Bo\u0161na\u010dki, D., Leue, S. (eds.) SPIN 2002. LNCS, vol.\u00a02318, pp. 22\u201341. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00625968","volume":"9","author":"C.N. Ip","year":"1996","unstructured":"Ip, C.N., Dill, D.L.: Better verification through symmetry. Form. Methods Syst. Des.\u00a09(1-2), 41\u201375 (1996)","journal-title":"Form. Methods Syst. Des."},{"key":"19_CR14","unstructured":"Langari, Z.: Modelling and Analysis using Graph Transformation Systems. Ph.D. thesis, University of Waterloo, Waterloo, Canada (2010)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11813040_24","volume-title":"FM 2006: Formal Methods","author":"Z. Langari","year":"2006","unstructured":"Langari, Z., Trefler, R.: Formal modeling of communication protocols by graph transformation. In: Misra, J., Nipkow, T., Karakostas, G. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 348\u2013363. Springer, Heidelberg (2006)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-00255-7_18","volume-title":"Integrated Formal Methods","author":"Z. Langari","year":"2009","unstructured":"Langari, Z., Trefler, R.: Application of graph transformation in verification of dynamic systems. In: Leuschel, M., Wehrheim, H. (eds.) IFM 2009. LNCS, vol.\u00a05423, pp. 261\u2013276. Springer, Heidelberg (2009)"},{"key":"19_CR17","first-page":"45","volume":"30","author":"B. McKay","year":"1981","unstructured":"McKay, B.: Practical graph isomorphism. Congressus Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"19_CR18","unstructured":"Rensink, A.: Isomorphism checking in groove. ECEASST\u00a01 (2006)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-68679-8_8","volume-title":"Concurrency, Graphs and Models","author":"A. Rensink","year":"2008","unstructured":"Rensink, A.: Explicit state model checking for graph grammars. In: Degano, P., De Nicola, R., Bevilacqua, V. (eds.) Concurrency, Graphs and Models. LNCS, vol.\u00a05065, pp. 114\u2013132. Springer, Heidelberg (2008)"},{"key":"19_CR20","series-title":"Foundations","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations","year":"1997","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol.\u00a01. World Scientific, Singapore (1997)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-93900-9_26","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R.J. Trefler","year":"2009","unstructured":"Trefler, R.J., Wahl, T.: Extending symmetry reduction by exploiting system architecture. In: Jones, N.D., M\u00fcller-Olm, M. (eds.) VMCAI 2009. LNCS, vol.\u00a05403, pp. 320\u2013334. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20398-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T18:28:37Z","timestamp":1558549717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20398-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642203978","9783642203985"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20398-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}