{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:40:53Z","timestamp":1725543653999},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540346999"},{"type":"electronic","value":"9783540347002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11767589_19","type":"book-chapter","created":{"date-parts":[[2006,6,20]],"date-time":"2006-06-20T14:38:34Z","timestamp":1150814314000},"page":"342-361","source":"Crossref","is-referenced-by-count":1,"title":["On the Step Explosion Problem"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Roch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsten","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"241","volume":"2","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Using branching time temporal logic to synthesize synchronization skeletons. Science of Computing\u00a02, 241\u2013266 (1982)","journal-title":"Science of Computing"},{"key":"19_CR2","unstructured":"Godefroid, P.: Partial\u2013Order Methods for the Verification of Concurrent Systems: An Approach to the State\u2013Explosion Problem. PhD thesis, University of Liege, Computer Science Department (1994)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/3-540-15204-0_13","volume-title":"Advances in Petri Nets 1984","author":"P. Huber","year":"1985","unstructured":"Huber, P., Jensen, A., Jepsen, L., Jensen, K.: Towards reachability trees for high\u2013level Petri nets. In: Rozenberg, G. (ed.) APN 1984. LNCS, vol.\u00a0188, pp. 215\u2013233. Springer, Heidelberg (1985)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-54430-5_97","volume-title":"CONCUR \u201991","author":"R. Janicki","year":"1991","unstructured":"Janicki, R., Koutny, M.: Invariant Semantics of Nets with Inhibitor Arcs. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, pp. 317\u2013331. Springer, Heidelberg (1991)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-54152-7_58","volume-title":"PARLE \u201991. Parallel Architectures and Languages Europe","author":"R. Janicki","year":"1991","unstructured":"Janicki, R., Koutny, M.: Invariants and Paradigms of Concurrency Theory. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991. LNCS, vol.\u00a0506, pp. 59\u201374. Springer, Heidelberg (1991)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(93)90238-O","volume":"112","author":"R. Janicki","year":"1993","unstructured":"Janicki, R., Koutny, M.: Structure of Concurrency. Theoretical Computer Science\u00a0112, 5\u201352 (1993)","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1995.1153","volume":"123","author":"R. Janicki","year":"1995","unstructured":"Janicki, R., Koutny, M.: Semantics of Inhibitor Nets. Information and Computation\u00a0123, 1\u201316 (1995)","journal-title":"Information and Computation"},{"key":"19_CR8","unstructured":"Mailund, T.: Sweeping the State Space - a sweep-line state space exploration method. PhD thesis, University of Aarhus (2003)"},{"issue":"6","key":"19_CR9","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Rossi, F.: Contextual Nets. Acta Informatica\u00a032(6), 545\u2013596 (1995)","journal-title":"Acta Informatica"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model\u2013checking using representitives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"19_CR11","unstructured":"Rausch, M.: Modulare Modellbildung, Syntese und Codegenerierung ereignisdiskreter Steuerungssysteme. PhD thesis, Otto-von-Guerike Universit\u00e4t Magdeburg, Lehrstuhl Steuerungstechnik (1996)"},{"key":"19_CR12","unstructured":"Roch, S., Starke, P.H.: INA - Integrated Net Analyzer - Version 2.2 - Manual. Technical report, Informatik-Berichte, Humboldt-Universit\u00e4t zu Berlin (1998)"},{"key":"19_CR13","unstructured":"Roch, S., Starke, P.: The sesa home page (2002), http:\/\/www.informatik.hu-berlin.de\/lehrstuehle\/automaten\/sesa\/"},{"issue":"7","key":"19_CR14","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(7), 545\u2013590 (2000)","journal-title":"Acta Informatica"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-24730-2_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Schmidt","year":"2004","unstructured":"Schmidt, K.: Automated generation of a progress measure for the sweep-line method. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 192\u2013204. Springer, Heidelberg (2004)"},{"key":"19_CR16","unstructured":"Starke, P.H., Roch, S.: Analysing Signal-Net Systems. Informatik-Berichte 162, Humboldt-Universit\u00e4t zu Berlin (2002)"},{"key":"19_CR17","first-page":"294","volume":"8","author":"P. Starke","year":"1991","unstructured":"Starke, P.: Reachability analysis of Petri nets using symmetries. J. Syst. Anal. Model. Simul.\u00a08, 294\u2013303 (1991)","journal-title":"J. Syst. Anal. Model. Simul."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM J. Comput.\u00a01, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"19_CR19","unstructured":"Valmari, A.: Error detection by reduced reachability graph generation. In: Proceedings of the Ninth European Workshop on Application and Theory of Petri Nets, Venice, Italy, pp. 95\u2013112 (1988)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn Sets for Reduced State Space Generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol.\u00a0483, pp. 491\u2013515. Springer, Heidelberg (1991)"},{"key":"19_CR21","unstructured":"van Glabbeek, R.: Personal communication (2005)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Vogler, W.: Partial Order Semantics and Read Arcs. Technical Report 1997-1, Universit\u00e4t Augsburg (1997)","DOI":"10.1007\/BFb0029994"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BFb0055644","volume-title":"CONCUR \u201998 Concurrency Theory","author":"W. Vogler","year":"1998","unstructured":"Vogler, W., Semenov, A., Yakovlev, A.: Unfolding and Finite Prefix for Nets with Read Arcs. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 501\u2013516. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Petri Nets and Other Models of Concurrency - ICATPN 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11767589_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:26Z","timestamp":1619507486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11767589_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540346999","9783540347002"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11767589_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}