{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T13:55:26Z","timestamp":1774878926749,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Formal Methods in System Design"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1023\/a:1020321222420","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T08:44:30Z","timestamp":1047717870000},"page":"281-315","source":"Crossref","is-referenced-by-count":27,"title":["Hierarchical Reachability Graph Generation for Petri Nets"],"prefix":"10.1007","volume":"21","author":[{"given":"Peter","family":"Buchholz","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kemper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5099178_CR1","doi-asserted-by":"crossref","unstructured":"S. Allmaier, M. Kowarschik, and G. Horton, \u201cState space construction and steady state solution of GSPNs on a shared-memory multiprocessor,\u201d in Proc. 7th Int. Workshop on Petri Nets and Performance Models (PNPM'97), IEEE CS Press, 1997, pp. 112-121.","DOI":"10.1109\/PNPM.1997.595542"},{"key":"5099178_CR2","first-page":"9","volume":"49","author":"F. Bause","year":"1995","unstructured":"F. Bause, P. Kemper, and P. Kritzinger, \u201cAbstract Petri net notation,\u201d Petri Net Newsletter, Vol. 49, pp. 9-27, 1995.","journal-title":"Petri Net Newsletter"},{"key":"5099178_CR3","unstructured":"G. Berthelot, \u201cTransformation and decomposition of nets,\u201d in G. Rozenberg (Ed.), Advances in Petri Nets 85, Springer, 1986. LNCS, Vol. 254."},{"key":"5099178_CR4","doi-asserted-by":"crossref","unstructured":"P. Buchholz, \u201cHierarchical high level Petri nets for complex system analysis,\u201d in R. Valette (Ed.), Application and Theory of Petri Nets, Springer, 1994, pp. 119-138. LNCS, Vol. 815.","DOI":"10.1007\/3-540-58152-9_8"},{"key":"5099178_CR5","unstructured":"P. Buchholz, \u201cMarkovian process algebra: Composition and equivalence,\u201d in U. Herzog and M. Rettelbach (Eds.), Proc. 2nd Workshop on Process Algebras and Performance Modelling, 1994; Arbeitsberichte des IMMD, Vol. 27, No. 4, pp. 11-30, 1994."},{"issue":"2","key":"5099178_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/32.761443","volume":"25","author":"P. Buchholz","year":"1999","unstructured":"P. Buchholz, \u201cHierarchical structuring of superposed GSPNs,\u201d IEEE Trans. on Softw. Eng., Vol. 25, No. 2, pp. 81-90, 1999.","journal-title":"IEEE Trans. on Softw. Eng"},{"issue":"4","key":"5099178_CR7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0168-9274(99)00005-7","volume":"31","author":"P. Buchholz","year":"1999","unstructured":"P. Buchholz, \u201cStructured analysis approaches for large Markov chains,\u201d Applied Numerical Mathematics, Vol. 31, No. 4, pp. 375-404, 1999.","journal-title":"Applied Numerical Mathematics"},{"key":"5099178_CR8","unstructured":"P. Buchholz and P. Kemper, \u201cHierarchical reachability graph generation for Petri nets,\u201d Forschungsbericht Nr. 660 des Fachbereichs Informatik der Universit\u00e4t Dortmund (Germany), 1997."},{"issue":"2","key":"5099178_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/288197.288202","volume":"26","author":"P. Buchholz","year":"1998","unstructured":"P. Buchholz and P. Kemper, \u201cOn generating a hierarchy for GSPN analysis,\u201d ACM Performance Evaluation Review, Vol. 26, No. 2, pp. 5-14, 1998.","journal-title":"ACM Performance Evaluation Review"},{"key":"5099178_CR10","doi-asserted-by":"crossref","unstructured":"P. Buchholz and P. Kemper, \u201cA toolbox for the analysis of discrete event dynamic systems,\u201d in N. Halbwachs and D. Peled (Eds.), Computer Aided Verification (CAV'99), Springer, 1999, pp. 483-486, LNCS, Vol. 1633.","DOI":"10.1007\/3-540-48683-6_41"},{"key":"5099178_CR11","doi-asserted-by":"crossref","unstructured":"P. Buchholz and P. Kemper, \u201cEfficient computation and representation of large reachability sets for composed automata,\u201d in R. Boel and G. Stremersch (Eds.), Discrete Event Systems Analysis and Control, Kluwer Academic, 2000, pp. 49-56.","DOI":"10.1007\/978-1-4615-4493-7_4"},{"key":"5099178_CR12","unstructured":"J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang, \u201cSymbolic model checking: 1020 states and beyond,\u201d in Proc. 5th Annual Symposium on Logic in Computer Science, June 1990."},{"issue":"2","key":"5099178_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/32.761442","volume":"25","author":"J. Campos","year":"1999","unstructured":"J. Campos, S. Donatelli, and J. Silva, \u201cStructured solution of asynchronously communicating stochastic modules,\u201d IEEE Trans. on Softw. Engineering, Vol. 25, No. 2, pp. 147-165, 1999.","journal-title":"IEEE Trans. on Softw. Engineering"},{"key":"5099178_CR14","doi-asserted-by":"crossref","unstructured":"S. Caselli, G. Conte, and P. Marenzoni, \u201cParallel state space exploration for GSPN models,\u201d in G. De Michelis and M. Diaz (Eds.), Application and Theory of Petri Nets 1995, Springer, 1995, pp. 181-200, LNCS, Vol. 935.","DOI":"10.1007\/3-540-60029-9_40"},{"key":"5099178_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0304-3975(96)00010-2","volume":"176","author":"G. Chiola","year":"1997","unstructured":"G. Chiola, C. Dutheillet, G. Franceschini, and S. Haddad, \u201cA symbolic reachability graph for coloured Petri nets,\u201d Theoretical Computer Science, Vol. 176, pp. 39-65, 1997.","journal-title":"Theoretical Computer Science"},{"key":"5099178_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/88.242441","volume":"1","author":"G. Chiola","year":"1993","unstructured":"G. Chiola and A. Ferscha, \u201cDistributed simulation of Petri nets,\u201d IEEE Parallel and Distributed Technology, Vol. 1, pp. 33-50, 1993.","journal-title":"IEEE Parallel and Distributed Technology"},{"key":"5099178_CR17","doi-asserted-by":"crossref","unstructured":"S. Christensen and L. Petrucci, \u201cModular state space analysis of coloured Petri nets,\u201d in G. De Michelis and M. Diaz (Eds.), Application and Theory of Petri Nets, Springer, 1995, pp. 201-217, LNCS, Vol. 935.","DOI":"10.1007\/3-540-60029-9_41"},{"key":"5099178_CR18","doi-asserted-by":"crossref","unstructured":"G. Ciardo, G. Luettgen, and R. Siminiceanu, \u201cSaturation: An efficient iteration strategy for symbolic statespace generation,\u201d in T. Margaria and W. Yi (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), Springer, 2001, pp. 328-342, LNCS, Vol. 2031.","DOI":"10.1007\/3-540-45319-9_23"},{"key":"5099178_CR19","doi-asserted-by":"crossref","unstructured":"G. Ciardo and A.S. Miner, \u201cStorage alternatives for large structured state spaces,\u201d in R. Marie, B. Plateau, M. Calzarossa, and G. Rubino (Eds.), Proc. 9th Int. Conf. Modelling Techniques and Tools for Computer Performance Evaluation, St. Malo, France, 1997, Springer, 1997, pp. 44-57. LNCS, Vol. 1245.","DOI":"10.1007\/BFb0022196"},{"issue":"2","key":"5099178_CR20","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"E.M. Clarke, E.A. Emerson, and A.P. Sistla, \u201cAutomatic verification of finite-state concurrent systems using temporal logic specifications,\u201d ACM Transactions on Programming Languages and Systems, Vol. 8, No. 2, pp. 244-263, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"5099178_CR21","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen, \u201cThe concurrency workbench: A semantics based tool for the verification of concurrent systems,\u201d ACM Transactions on Programming Languages and Systems, Vol. 15, No. 1, pp. 36-72, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5099178_CR22","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/TC.1981.6312174","volume":"30","author":"M. Davio","year":"1981","unstructured":"M. Davio, \u201cKronecker products and shuffle algebra,\u201d IEEE Trans. on Comp., Vol. 30, pp. 116-125, 1981.","journal-title":"IEEE Trans. on Comp"},{"key":"5099178_CR23","doi-asserted-by":"crossref","unstructured":"S. Donatelli, \u201cSuperposed generalized stochastic Petri nets: Definition and efficient solution,\u201d in R. Valette (Ed.), Application and Theory of Petri Nets, Springer, 1994, LNCS, Vol. 815.","DOI":"10.1007\/3-540-58152-9_15"},{"key":"5099178_CR24","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01383879","volume":"2","author":"P. Godefroid","year":"1993","unstructured":"P. Godefroid and P. Wolper, \u201cUsing partial orders for the efficient verification of deadlock freedom and safety properties,\u201d Formal Methods in System Design, Vol. 2, pp. 149-164, 1993.","journal-title":"Formal Methods in System Design"},{"key":"5099178_CR25","doi-asserted-by":"crossref","unstructured":"S. Haddad, \u201cA reduction theory for coloured Petri nets,\u201d in G. Rozenberg (Ed.), Advances in Petri Nets 1989, Springer, 1990, pp. 209-235. LNCS, Vol. 424.","DOI":"10.1007\/3-540-52494-0_31"},{"key":"5099178_CR26","unstructured":"M. Heiner and P. Deusen, \u201cPetri net based design and analysis of reactive systems,\u201d in Proc. 3rd Workshop on Discrete Event Systems (WoDES'96), pp. 308-313."},{"key":"5099178_CR27","unstructured":"M. Heiner, P. Deussen, and J. Spranger, \u201cA case study in developing control software on manufacturing systems,\u201d in M. Silva, R. Valette, and K. Takahashi (Eds.), Workshop on Manufacturing and Petri nets, within 17th Int. Conf. Application and Theory of Petri Nets, Osaka, Japan, 1996."},{"key":"5099178_CR28","unstructured":"G.J. Holzmann, \u201cOn limits and possibilities of automated protocol analysis,\u201d in Proc. 7th Int. Workshop Protocol Specification, Testing and Verification, North Holland, 1987."},{"key":"5099178_CR29","doi-asserted-by":"crossref","unstructured":"G.J. Holzmann, \u201cAn analysis of bitstate hashing,\u201d in Proc. 15th Int. Symp. Protocol Specification, Testing and Verification, IFIP, Chapman & Hall, 1995.","DOI":"10.1007\/978-0-387-34892-6_19"},{"key":"5099178_CR30","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, \u201cColoured Petri nets and the invariant method,\u201d Theor. Comp. Sci., Vol. 14, pp. 317-336, 1981.","journal-title":"Theor. Comp. Sci."},{"key":"5099178_CR31","unstructured":"K. Jensen, \u201cColoured Petri nets,\u201d Vol. 1; Springer, EATCS Monographs (1992)."},{"key":"5099178_CR32","doi-asserted-by":"crossref","unstructured":"P. Kemper, \u201cReachability analysis based on structured representations,\u201d in J. Billington and W. Reisig (Eds.), Application and Theory of Petri Nets 1996. Springer, 1996, pp. 269-288. LNCS, Vol. 1091.","DOI":"10.1007\/3-540-61363-3_15"},{"key":"5099178_CR33","doi-asserted-by":"crossref","unstructured":"C. Lewerentz and T. Lindner (Eds.), \u201cFormal development reactive systems,\u201d Springer, 1995, LNCS, Vol. 891.","DOI":"10.1007\/3-540-58867-1"},{"key":"5099178_CR34","doi-asserted-by":"crossref","unstructured":"P. Marenzoni, S. Caselli, and G. Conte, \u201cAnalysis of large GSPN models: A distributed solution tool,\u201d in. Proc. 7th Int. Workshop on Petri Nets and Performance Models (PNPM'97), IEEE CS Press, 1997, pp. 122-131.","DOI":"10.1109\/PNPM.1997.595543"},{"key":"5099178_CR35","doi-asserted-by":"crossref","unstructured":"J. Martinez and M. Silva, \u201cA simple and fast algorithm to obtain all invariants of a generalized Petri net,\u201d in Application and Theory of Petri Nets 1981, Springer, IFB 52, 1981.","DOI":"10.1007\/978-3-642-68353-4_47"},{"key":"5099178_CR36","unstructured":"R. Milner, \u201cCommunication and concurrency,\u201d Prentice Hall, 1989."},{"key":"5099178_CR37","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"T. Murata, \u201cPetri nets: Properties, analysis and applications,\u201d Proc. of the IEEE, Vol. 77, pp. 541-580, 1989.","journal-title":"Proc. of the IEEE"},{"key":"5099178_CR38","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jpdc.1997.1409","volume":"47","author":"D. Nicol","year":"1997","unstructured":"D. Nicol and G. Ciardo, \u201cAutomated parallelization of discrete state-space generation,\u201d Journal of Parallel and Distributed Computing, Vol. 47, pp. 153-167, 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5099178_CR39","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/32.286423","volume":"20","author":"M. Notomi","year":"1994","unstructured":"M. Notomi and T. Murata, \u201cHierarchical reachability graph generation of bounded Petri nets for concurrentsoftware analysis,\u201d IEEE Trans. on Softw. Eng., Vol. 20, pp. 325-336, 1994.","journal-title":"IEEE Trans. on Softw. Eng."},{"key":"5099178_CR40","doi-asserted-by":"crossref","unstructured":"E. Pastor, O. Roig, J. Cortadella, and R.M. Badia, \u201cPetri net analysis using Boolean manipulation,\u201d in R. Valette (Ed.), Application and Theory of Petri Nets 1994, Springer, 1994. LNCS, Vol. 815.","DOI":"10.1007\/3-540-58152-9_23"},{"key":"5099178_CR41","doi-asserted-by":"crossref","unstructured":"L. Pomello, G. Rozenberg, and C. Simone, \u201cA survey of equivalence relations for net based systems,\u201d in G. Rozenberg (Ed.), Advances in Petri Nets 1992, Springer, 1992, pp. 410-472. LNCS, Vol. 609.","DOI":"10.1007\/3-540-55610-9_180"},{"key":"5099178_CR42","unstructured":"Proc. 7th Int. Workshop on Petri Nets and Performance Models (PNPM'97), IEEE CS Press, 1997."},{"key":"5099178_CR43","doi-asserted-by":"crossref","unstructured":"L. Recalde, E. Teruel, and M. Silva; {SC}*\nECS: \u201cA class of modular and hierarchical cooperating systems.\u201d in J. Billington and W. Reisig (Eds.), Application and Theory of Petri Nets 1996, Springer, 1996, pp. 440-459. LNCS, Vol. 1091.","DOI":"10.1007\/3-540-61363-3_24"},{"key":"5099178_CR44","doi-asserted-by":"crossref","unstructured":"R. Valette (Ed.), Application and Theory of Petri Nets, Springer, 1994. LNCS, Vol. 815.","DOI":"10.1007\/3-540-58152-9"},{"key":"5099178_CR45","doi-asserted-by":"crossref","unstructured":"A. Valmari, \u201cCompositional analysis with place bordered subnets,\u201d in R. Valette (Ed.), Application and Theory of Petri Nets, Springer, 1994, pp. 531-547. LNCS, Vol. 815.","DOI":"10.1007\/3-540-58152-9_29"},{"key":"5099178_CR46","first-page":"6","volume":"46","author":"A. Valmari","year":"1994","unstructured":"A. Valmari, \u201cState of the art report: Stubborn sets,\u201d Petri Net Newsletter, Vol. 46, pp. 6-14, 1994.","journal-title":"Petri Net Newsletter"},{"key":"5099178_CR47","doi-asserted-by":"crossref","unstructured":"P. Wolper and D. Leroy, \u201cReliable hashing without collision detection,\u201d in 5th Int. Conf. Computer Aided Verification, Elounda, Greece, 1993.","DOI":"10.1007\/3-540-56922-7_6"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020321222420.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020321222420\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020321222420.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T19:08:14Z","timestamp":1754420894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020321222420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["5099178"],"URL":"https:\/\/doi.org\/10.1023\/a:1020321222420","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}