{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:51Z","timestamp":1759639071201},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222361"},{"type":"electronic","value":"9783540277934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27793-4_15","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T22:49:31Z","timestamp":1283726971000},"page":"258-277","source":"Crossref","is-referenced-by-count":5,"title":["New Canonical Representative Marking Algorithms for Place\/Transition-Nets"],"prefix":"10.1007","author":[{"given":"Tommi A.","family":"Junttila","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","first-page":"293","volume":"8","author":"P.H. Starke","year":"1991","unstructured":"Starke, P.H.: Reachability analysis of Petri nets using symmetries. Systems Analysis Modelling Simulation\u00a08, 293\u2013303 (1991)","journal-title":"Systems Analysis Modelling Simulation"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s002360050002","volume":"36","author":"K. Schmidt","year":"2000","unstructured":"Schmidt, K.: How to calculate symmetries of Petri nets. Acta Informatica\u00a036, 545\u2013590 (2000)","journal-title":"Acta Informatica"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-46419-0_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Schmidt","year":"2000","unstructured":"Schmidt, K.: Integrating low level symmetries into reachability analysis. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 315\u2013330. Springer, Heidelberg (2000)"},{"key":"15_CR4","first-page":"307","volume":"7","author":"T.A. Junttila","year":"2001","unstructured":"Junttila, T.A.: Computational complexity of the Place\/Transition-net symmetry reduction method. Journal of Universal Computer Science\u00a07, 307\u2013326 (2001)","journal-title":"Journal of Universal Computer Science"},{"key":"15_CR5","unstructured":"Junttila, T.: On the symmetry reduction method for Petri nets and similar formalisms. Research Report A80, Helsinki Univ. of Technology, Lab. for Theoretical Computer Science, Doctoral dissertation (2003)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Fundamental Algorithms for Permutation Groups","year":"1991","unstructured":"Butler, G. (ed.): Fundamental Algorithms for Permutation Groups. LNCS, vol.\u00a0559. Springer, Heidelberg (1991)"},{"key":"15_CR7","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congressus Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"15_CR8","volume-title":"Combinatorial Algorithms: Generation, Enumeration and Search","author":"D.L. Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration and Search. CRC Press, Boca Raton (1999)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-44988-4_27","volume-title":"Application and Theory of Petri Nets 2000","author":"K. Schmidt","year":"2000","unstructured":"Schmidt, K.: LoLA: A low level analyser. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 465\u2013474. Springer, Heidelberg (2000)"},{"key":"15_CR10","series-title":"Monographs in Theoretical Computer Science","volume-title":"Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Vol. 2, Analysis Methods","author":"K. Jensen","year":"1995","unstructured":"Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Vol. 2, Analysis Methods. Monographs in Theoretical Computer Science. Springer, Heidelberg (1995)"},{"key":"15_CR11","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. Formal Methods in System Design\u00a09, 105\u2013131 (1996)","journal-title":"Formal Methods in System Design"},{"key":"15_CR12","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. Formal Methods in System Design\u00a09, 77\u2013104 (1996)","journal-title":"Formal Methods in System Design"},{"key":"15_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. Formal Methods in System Design\u00a09, 41\u201376 (1996)","journal-title":"Formal Methods in System Design"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/262004.262008","volume":"19","author":"E.A. Emerson","year":"1997","unstructured":"Emerson, E.A., Sistla, A.P.: Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach. ACM Transactions on Programming Languages and Systems\u00a019, 617\u2013638 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1008701202999","volume":"15","author":"V. Gyuris","year":"1999","unstructured":"Gyuris, V., Sistla, A.P.: On-the-fly model checking under fairness that exploits symmetry. Formal Methods in System Design\u00a015, 217\u2013238 (1999)","journal-title":"Formal Methods in System Design"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: On well-formed coloured nets and their symbolic reachability graph. In: [26], pp. 373\u2013396","DOI":"10.1007\/978-3-642-84524-6_13"},{"key":"15_CR17","unstructured":"Junttila, T.: Detecting and exploiting data type symmetries of algebraic system nets during reachability analysis. Research Report A57, Helsinki Univ. of Technology, Lab. for Theoretical Computer Science (1999)"},{"key":"15_CR18","unstructured":"Ip, C.N.: State Reduction Methods for Automatic Formal Verification. PhD thesis, Department of Computer Science, Stanford University (1996)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Huber, P., Jensen, A.M., Jepsen, L.O., Jensen, K.: Towards reachability trees for high-level Petri nets. Technical Report DAIMI PB 174, Datalogisk Afdeling, Matematisk Institut, Aarhus Universitet (1985)","DOI":"10.7146\/dpb.v13i174.7449"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/350887.350891","volume":"9","author":"A.P. Sistla","year":"2000","unstructured":"Sistla, A.P., Gyuris, V., Emerson, E.A.: SMC: A symmetry-based model checker for verification of safety and liveness properties. ACM Transactions on Software Engineering and Methodology\u00a09, 133\u2013166 (2000)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"15_CR21","unstructured":"Junttila, T.: Symmetry reduction algorithms for data symmetries. Research Report A72, Helsinki Univ. of Technology, Lab. for Theoretical Computer Science (2002)"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/CSD.2001.981778","volume-title":"Proceedings of the Second International Conference on Application of Concurrency to System Design (ACSD 2001)","author":"L. Lorentsen","year":"2001","unstructured":"Lorentsen, L., Kristensen, L.M.: Exploiting stabilizers and parallelism in state space generation with the symmetry method. In: Proceedings of the Second International Conference on Application of Concurrency to System Design (ACSD 2001), pp. 211\u2013220. IEEE Computer Society, Los Alamitos (2001)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Genrich, H.J.: Predicate\/transition nets. In: [26], pp. 3\u201343","DOI":"10.1007\/978-3-642-84524-6_1"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0196-6774(86)90038-6","volume":"7","author":"M. Jerrum","year":"1986","unstructured":"Jerrum, M.: A compact representation for permutation groups. Journal of Algorithms\u00a07, 60\u201378 (1986)","journal-title":"Journal of Algorithms"},{"key":"15_CR25","series-title":"Monographs in Theoretical Computer Science","volume-title":"Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Vol. 1, Basic Concepts","author":"K. Jensen","year":"1992","unstructured":"Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Vol. 1, Basic Concepts, 2nd edn. Monographs in Theoretical Computer Science. Springer, Heidelberg (1992)","edition":"2"},{"volume-title":"High-level Petri Nets; Theory and Application","year":"1991","key":"15_CR26","unstructured":"Jensen, K., Rozenberg, G. (eds.): High-level Petri Nets; Theory and Application. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27793-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:20:30Z","timestamp":1605759630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27793-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222361","9783540277934"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27793-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}