{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T03:55:38Z","timestamp":1791172538488,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540672821","type":"print"},{"value":"9783540464198","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46419-0_22","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T23:17:25Z","timestamp":1186615045000},"page":"315-330","source":"Crossref","is-referenced-by-count":20,"title":["Integrating Low Level Symmetries into Reachability Analysis"],"prefix":"10.1007","author":[{"given":"Karsten","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"22_CR1","unstructured":"G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. On well-formed colored nets and their symbolic reachability graph. Proc. of the 11th Int. Conf. on Application and Theory of Petri Nets, pages 387\u2013410, 1990. 315, 328"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF00625969","volume":"9","author":"E.M. Clarke","year":"1996","unstructured":"E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. Formal Methods in System Design 9, pages 77\u2013104, 1996. 315, 316, 323, 324","journal-title":"Formal Methods in System Design"},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-58152-9_9","volume-title":"Proc. 15th Int. Conf. on Application and Theory of Petri Nets","author":"G. Chiola","year":"1994","unstructured":"G. Chiola, G. Franceschinis, and R. Gaeta. Modelling symmetric computer architectures by swn\u2019s. Proc. 15th Int. Conf. on Application and Theory of Petri Nets, LNCS 815, pages 139\u2013158, 1994. 315, 328"},{"key":"22_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-69108-1_3","volume-title":"Proc. 19th International Conference on Application and Theory of Petri nets","author":"G. Chiola","year":"1998","unstructured":"G. Chiola. Manual and automatic exploitation of symmetries in spn models. Proc. 19th International Conference on Application and Theory of Petri nets, LNCS 1420, pages 28\u201343, 1998. 315"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"S. Duri, U. Buy, R. Devarapalli, and S. Shatz. Using state space methods for deadlock analysis in ada tasking. ACM Proc. Int. Symp. on Software Testing and Analysis, pages 51\u201360, 1993. 328","DOI":"10.1145\/154183.154197"},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0035378","volume-title":"Proc. TACAS\u2019 97","author":"E.A. Emerson","year":"1997","unstructured":"E.A. Emerson, S. Jha, and D. Peled. Combining partial order and symmetry reductions. Proc. TACAS\u2019 97, LNCS 1217, pages 19\u201334, 1997. 328"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E.A. Emerson","year":"1996","unstructured":"E.A. Emerson and A.P. Sistla. Symmetry and model checking. Formal Methods in System Design 9, pages 105\u2013131, 1996. 315, 324","journal-title":"Formal Methods in System Design"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Huber, A. Jensen, Jepsen, and K. Jensen. Towards reachability trees for high-level petri nets. In Advances in Petri Nets 1984, Lecture Notes on Computer Science 188, pages 215\u2013233, 1984. 315, 321, 323","DOI":"10.1007\/3-540-15204-0_13"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00625968","volume":"9","author":"C.N. Ip","year":"1996","unstructured":"C.N. Ip and D.L. Dill. Better verification through symmetry. Formal Methods in System Design 9, pages 41\u201375, 1996. 315, 316, 323","journal-title":"Formal Methods in System Design"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"K. Jensen. Coloured Petri Nets, volume 1 of EATCS Monographs on Theoretical Computer Science. Springer, 1992. 315","DOI":"10.1007\/978-3-662-06289-0"},{"key":"22_CR11","unstructured":"K. Jensen. Coloured Petri Nets Vol. 2: Analysis Methods. Springer, 1995. 324"},{"key":"22_CR12","unstructured":"T. Junttila. Towards well-formed algebraic system nets. Workshop CSP\u201998 Berlin, Technical Report 110, Humboldt-University Berlin, pages 116\u2013127, 1998. 315"},{"key":"22_CR13","unstructured":"S. Rochand P. Starke. INA \u2014 Integrierter Netz-Analysator Version 1.7. Handbuch. Humboldt-University Berlin, Institute of Computer Science, 1997. 316"},{"key":"22_CR14","unstructured":"K. Schmidt. How to calculate symmetries of petri nets. To appear in Acta Informatica. 316, 317, 321"},{"key":"22_CR15","first-page":"294","volume":"8","author":"P. Starke","year":"1991","unstructured":"P. Starke. Reachability analysis of petri nets using symmetries. J. Syst. Anal. Model. Simul., 8:294\u2013303, 1991. 315, 316","journal-title":"J. Syst. Anal. Model. Simul."},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"R.E. Tarjan. Efficiency ofa good but not linear set union algorithm. Journal of the ACM 22(2), pages 215\u2013225, 1975. 321","journal-title":"Journal of the ACM"},{"key":"22_CR17","unstructured":"A. Valmari. Error detection by reduced reachability graph generation. Proc. of the 9th European Workshop on Application and Theory of Petri Nets, Venice, 1988. 328"},{"key":"22_CR18","unstructured":"A. Valmari. Stubborn sets for coloured petri nets. In The Proceedings of the 12th International Conference on Application and Theory of Petri Nets, pages 102\u2013121, 1991. 328"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46419-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T21:07:20Z","timestamp":1556744840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46419-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672821","9783540464198"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-46419-0_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}