{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T20:53:36Z","timestamp":1761512016702},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form Method Syst Des"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1007\/bf00625967","type":"journal-article","created":{"date-parts":[[2004,11,30]],"date-time":"2004-11-30T17:17:52Z","timestamp":1101835072000},"page":"7-40","source":"Crossref","is-referenced-by-count":51,"title":["Condensed state spaces for symmetrical Coloured Petri Nets"],"prefix":"10.1007","volume":"9","author":[{"given":"Kurt","family":"Jensen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"G. Chiola, C. Dutheillet, G. Franceschinis, and S. haddad,On Well-Formed Coloured Nets and Their Symbolic Reachability Graph. In [14], pp. 373?396.","DOI":"10.1007\/978-3-642-84524-6_13"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad,A Symbolic Reachability Graph for Coloured Petri Nets. To appear in Theoretical Computer Science, 1997.","DOI":"10.1016\/S0304-3975(96)00010-2"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"E.M. Clarke, T. Filkorn, and S. Jha, ?Exploiting symmetry in temporal logic model checking,? inComputer Aided Verification. Proceedings of the 5th International Conference on Computer Aided Verification, C. Courcoubetis (Ed.), Elounda, Greece, 1993, Lecture Notes in Computer Science, Vol. 697, pp. 450?462, Springer-Verlag 1993.","DOI":"10.1007\/3-540-56922-7_37"},{"key":"CR4","unstructured":"Design\/CPN. Reference Manual. Computer Science Department, University of Aarhus, Denmark. On-line version: http:\/\/www.daimi.aau.dk\/designCPN\/."},{"key":"CR5","unstructured":"Design\/CPN Occurrence Graph Manual. Computer Science Department, University of Aarhus, Denmark. On-line version: http:\/\/www.daimi.aau.dk\/designCPN\/."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"E.A. Emerson and A.P. Sistla, ?Symmetry and model checking,? inComputer Aided Verification. Proceedings of the 5th International Conference on Computer Aided Verification, C. Courcoubetis (Ed.), Elounda, Greece, 1993, Lecture Notes in Computer Science, Vol. 697, pp. 463?477, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56922-7_38"},{"key":"CR7","unstructured":"A. Finkel, ?A minimal coverability graph for Petri nets,?Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris, 1990, pp. 1?21."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(81)90113-4","volume":"13","author":"H.J. Genrich","year":"1981","unstructured":"H.J. Genrich and K. Lautenbach, ?System modelling with highlevel petri nets,?Theoretical Computer Science, Vol. 13, pp. 109?136, North Holland, 1981.","journal-title":"Theoretical Computer Science"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"P. Huber, A.M. Jensen, L.O. Jepsen, and K. Jensen, ?Reachability trees for high-level Petri nets,?Theoretical Computer Science, Vol. 45, pp. 261?292. Also in [14], pp. 319?350, North-Holland, 1986.","DOI":"10.1016\/0304-3975(86)90046-0"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(81)90049-9","volume":"14","author":"K. Jensen","year":"1981","unstructured":"K. Jensen, ?Coloured Petri Nets and the invariant method,?Theoretical Computer Science, Vol. 14, pp. 317?336, North-Holland, 1981.","journal-title":"Theoretical Computer Science"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"K. Jensen, ?Coloured Petri Nets: A highlevel language for system design and analysis,? inAdvances in Petri Nets 1990, G. Rozenberg (Ed.), Lecture Notes in Computer Science Vol. 483, pp. 342?416, Springer-Verlag 1991, also in [14], 44?122.","DOI":"10.1007\/3-540-53863-1_31"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"K. Jensen,Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use, Vol. 1, Basic Concepts. Monographs in Theoretical Computer Science, Springer-Verlag, 1992.","DOI":"10.1007\/978-3-662-06289-0"},{"key":"CR13","unstructured":"K. Jensen,Coloured Petri Nets, Basic Concepts, Analysis Methods and Practical use, Vol. 2. Analysis Methods, Monographs in Theoretical Computer Science, Springer-Verlag, 1994."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"K. Jensen and G. Rozenberg (Eds.)High-level Petri Nets. Theory and Application. Springer-Verlag, 1991.","DOI":"10.1007\/978-3-642-84524-6"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"R.M. Karp and R.E. Miller, ?Parallel program schemata,?Journal of Computer and System Sciences, Vol. 3, pp. 147?195, 1969.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"M. Lindqvist,Parameterized Reachability Trees for Predicate\/Transition Nets. In G. Rozenberg (Ed.),Advances in Petri Nets 1993, Lecture Notes in Computer Science, Vol. 674, pp. 301?324, Springer-Verlag, 1993, also in [14], pp. 351?372.","DOI":"10.1007\/3-540-56689-9_49"},{"key":"CR17","unstructured":"R. Milner, R. Harper, and M. Tofte,The Definition of Standard ML, MIT Press, 1990."},{"key":"CR18","unstructured":"R. Milner and M. Tofte,Commentary on Standard ML. MIT Press, 1991."},{"key":"CR19","unstructured":"L. Paulson,ML for the Working Programmer. Cambridge University Press, 1991."},{"key":"CR20","series-title":"Petri Net Newsletter","first-page":"32","volume-title":"Combining Finkels and Jensens Reduction Techniques to Build Covering Trees for Coloured Nets","author":"L. Petrucci","year":"1990","unstructured":"L.Petrucci,Combining Finkels and Jensens Reduction Techniques to Build Covering Trees for Coloured Nets. Petri Net Newsletter No. 36 (August 1990), Special Interest Group on Petri Nets and Related System Models, Gesellschaft f\u00fcr Informatik (GI), Germany, 1990, 32?36."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"A. Valmari, ?Stubborn sets for reduced state space generation,? in Advances in Petri Nets G. Rozenberg (Ed.) 1990, Lecture Notes in Computer Science Vol. 483, Springer-Verlag, 1991, 491?515.","DOI":"10.1007\/3-540-53863-1_36"},{"key":"CR22","unstructured":"A. Valmari, ?Stubborn sets of coloured Petri nets,?Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Aarhus, 1991, 102?121."}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00625967.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00625967\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00625967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T12:12:33Z","timestamp":1586002353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00625967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["BF00625967"],"URL":"https:\/\/doi.org\/10.1007\/bf00625967","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}