{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:14:29Z","timestamp":1754486069675,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613633"},{"type":"electronic","value":"9783540685050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61363-3_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:34:52Z","timestamp":1330292092000},"page":"269-288","source":"Crossref","is-referenced-by-count":16,"title":["Reachability analysis based on structured representations"],"prefix":"10.1007","author":[{"given":"Peter","family":"Kemper","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"15_CR1","unstructured":"G. Balbo, G. Chiola, G. Franceschinis, and G. Molinar-Roet. On the efficient construction of the tangible reachability graph of generalized stochastic Petri nets. In Int. Work. Petri Nets and Performance Models. IEEE Computer Society, 1987."},{"key":"15_CR2","unstructured":"A. Blakemore. The cost of eliminating vanishing markings from generalized stochastic Petri nets. In 3rd Int. Work. Petri Nets and Performance Models. IEEE Computer Society, 1989."},{"key":"15_CR3","unstructured":"P. Buchholz. Numerical solution methods based on structured descriptions of Markovian models. In 5th Int. Conf. Modeling Techniques and Tools, 1991."},{"key":"15_CR4","unstructured":"P. Buchholz. Markovian process algebra: Composition and equivalence. In 2nd Work. Process Algebras and Performance Modelling, 1994."},{"key":"15_CR5","unstructured":"P. Buchholz. On a Markovian process algebra. Technical Report 500, Universit\u00e4t Dortmund, 1994."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"S. Caselli, G. Conte, F. Bonardi, and M. Fontanesi. Experiences on SIMD massively parallel GSPN analysis. In Computer Performance Eval., Springer, 1994.","DOI":"10.1007\/3-540-58021-2_15"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"S. Caselli, G. Conte, and P. Marenzoni. Parallel state space exploration for GSPN models. In 16th int. Conf. Application and Theory of Petri Nets, Springer, 1995.","DOI":"10.1007\/3-540-60029-9_40"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"G. Chiola. Compiling techniques for the analysis of stochastic Petri nets. In 4th Int. Conf. on Modeling Techniques and Tools, Mallorca, 1989.","DOI":"10.1007\/978-1-4613-0533-0_2"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"S. Christensen and L. Petrucci. Modular state space analysis of coloured Petri nets. In 16th int. Conf. Application and Theory of Petri Nets, Springer, 1995.","DOI":"10.1007\/3-540-60029-9_41"},{"key":"15_CR10","unstructured":"G. Ciardo and K.S. Trivedi. A decomposition approach for stochastic Petri net models. In 4th Int. Work. Petri Nets and Performance Models. IEEE Computer Society, 1991."},{"issue":"2","key":"15_CR11","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/TC.1981.6312174","volume":"C-30","author":"M. Davio","year":"1981","unstructured":"M. Davio. Kronecker products and shuffle algebra. IEEE Transactions on Computers, C-30(2):116\u2013125, February 1981.","journal-title":"IEEE Transactions on Computers"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-5316(93)90025-P","volume":"18","author":"S. Donatelli","year":"1993","unstructured":"S. Donatelli. Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space. Performance Eval., 18:21\u201326, 1993.","journal-title":"Performance Eval."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"S. Donatelli. Superposed generalized stochastic Petri nets: definition and efficient solution. In 15th int. Conf. Application and Theory of Petri nets, Springer, 1994.","DOI":"10.1007\/3-540-58152-9_15"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"P. Godefroid. Using partial orders to improve automatic verification methods. In 2nd int. Work. Computer Aided Verification, LNCS 531. Springer, 1990.","DOI":"10.1090\/dimacs\/003\/21"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"P. Godefroid and D. Pirottin. Refining dependencies improves partial-order verification methods. In 5th int. Conf. Computer Aided Verification, LNCS 697. Springer, 1993.","DOI":"10.1007\/3-540-56922-7_36"},{"key":"15_CR16","unstructured":"G.J. Holzmann. On limits and possibilities of automated protocol analysis. In 7th int. Work. Protocol Specification, Testing, and Verification. North-Holland, 1987."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"G.J. Holzmann. An analysis of bitstate hashing. In 15th int. Symp Protocol Specification, Testing and Verification, IFIP. Chapman & Hall, 1995.","DOI":"10.1007\/978-0-387-34892-6_19"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"P. Kemper. Closing the gap between classical and tensor based iteration techniques (extended abstract). In Computations with Markov Chains. Kluwer, 1995.","DOI":"10.1007\/978-1-4615-2241-6_31"},{"key":"15_CR19","unstructured":"P. Kemper. Numerical analysis of superposed GSPNs. In 6th Int. Work. Petri Nets and Performance Models. IEEE Computer Society Press, 1995."},{"issue":"10","key":"15_CR20","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1109\/32.99196","volume":"17","author":"B. Plateau","year":"1991","unstructured":"B. Plateau and K. Atif. Stochastic automata network for modelling parallel systems. IEEE Trans, on Software Engineering, 17(10):1093\u20131108, 1991.","journal-title":"IEEE Trans, on Software Engineering"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"B. Plateau and J.M. Fourneau. A methodology for solving Markov models of parallel systems. Journal of Parallel and Distributed Computing, 12, 1991.","DOI":"10.1016\/0743-7315(91)90007-V"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"W.J. Stewart. Introduction to the numerical solution of Markov chains. Princeton University Press, 1994.","DOI":"10.1515\/9780691223384"},{"key":"15_CR23","unstructured":"A. Valmari. Error detection by reduced reachability graph generation. In 9th Europ. Work. Application and Theory of Petri Nets, Venice, Italy, 1988."},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"A. Valmari. Stubborn sets for reduced state space generation. In Advances in Petri Nets, LNCS 483. Springer, 1990.","DOI":"10.1007\/3-540-53863-1_36"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"P. Wolper and P. Godefroid. Partial order methods for temporal verification. In 4th int. Conf. Concurrency Theory, LNCS 715. Springer, 1993.","DOI":"10.1007\/3-540-57208-2_17"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"P. Wolper and D. Leroy. Reliable hashing without collision detection. In 5th int. Conf. Computer Aided Verification, Elounda, Greece, 1993.","DOI":"10.1007\/3-540-56922-7_6"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61363-3_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:18:25Z","timestamp":1742599105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61363-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613633","9783540685050"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-61363-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}