{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T09:55:28Z","timestamp":1794390928115,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642218330","type":"print"},{"value":"9783642218347","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21834-7_11","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T22:04:11Z","timestamp":1309212251000},"page":"189-207","source":"Crossref","is-referenced-by-count":0,"title":["Finding a Witness Path for Non-liveness in Free-Choice Nets"],"prefix":"10.1007","author":[{"given":"Harro","family":"Wimmel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karsten","family":"Wolf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-55676-1_4","volume-title":"Application and Theory of Petri Nets 1992","author":"K. Barkaoui","year":"1992","unstructured":"Barkaoui, K., Minoux, M.: A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol.\u00a0616, pp. 62\u201375. Springer, Heidelberg (1992)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-61363-3_4","volume-title":"Application and Theory of Petri Nets 1996","author":"K. Barkaoui","year":"1996","unstructured":"Barkaoui, K., Pradat-Peyre, J.: On Liveness and Controlled Siphons in Petri Nets. In: Billington, J., Reisig, W. (eds.) ICATPN 1996. LNCS, vol.\u00a01091, pp. 57\u201372. Springer, Heidelberg (1996)"},{"key":"11_CR3","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526558","volume-title":"Free Choice Petri Nets","author":"J. Desel","year":"1995","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol.\u00a040. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0166-3615(94)90004-3","volume":"24","author":"K. D\u2019Souza","year":"1994","unstructured":"D\u2019Souza, K., Khator, S.: A survey of Petri net applications in modeling controls for automated manufacturing systems. Computers in Industry\u00a024(1), 5\u201316 (1994)","journal-title":"Computers in Industry"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03848-8_19","volume-title":"Business Process Management","author":"D. Fahland","year":"2009","unstructured":"Fahland, D., Favre, C., Jobstmann, B., Koehler, J., Lohmann, N., V\u00f6lzer, H., Wolf, K.: Instantaneous soundness checking of industrial business process models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol.\u00a05701, Springer, Heidelberg (2009)"},{"key":"11_CR6","unstructured":"Hack, M.: Analysis of Production Schemata by Petri Nets. Massachusetts Institute of Technology, 1972. MS Thesis, corrected (1974)"},{"key":"11_CR7","unstructured":"Hack, M.: Decidability Questions for Petri Nets. Massachusetts Institute of Technology, Ph.D. Thesis (1976)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"N. Jones","year":"1977","unstructured":"Jones, N., Landweber, L., Lien, Y.: Complexity of some problems in petri nets. Theoretical Computer Science\u00a04, 277\u2013299 (1977)","journal-title":"Theoretical Computer Science"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: Proceedings of the 14th Annual ACM STOC, pp. 267\u2013281 (1982)","DOI":"10.1145\/800070.802201"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"J.L. Lambert","year":"1992","unstructured":"Lambert, J.L.: A structure to decide reachability in Petri nets. Theoretical Computer Science\u00a099, 79\u2013104 (1992)","journal-title":"Theoretical Computer Science"},{"key":"11_CR11","unstructured":"Lipton, R.J.: The Reachability Problem Requires Exponential Space. Research Report, 62 (1976)"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. SIAM Journal of Computing\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM Journal of Computing"},{"key":"11_CR13","unstructured":"MiniSat. Minimalistic, open-source SAT solver (2007), http:\/\/www.minisat.se"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-13675-7_16","volume-title":"Applications and Theory of Petri Nets","author":"O. Oanea","year":"2010","unstructured":"Oanea, O., Wimmel, H., Wolf, K.: New Algorithms for Deciding the Siphon-Trap Property. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol.\u00a06128, pp. 267\u2013286. Springer, Heidelberg (2010)"},{"key":"11_CR15","unstructured":"Talcott, C., Dill, D.: The pathway logic assistent. In: Third International Workshop on Computational Methods in Systems Biology (2005)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"8","author":"W. van der Aalst","year":"1998","unstructured":"van der Aalst, W.: The Application of Petri Nets to Workflow Management. Journal of Circuits, Systems and Computers\u00a08(1), 21\u201366 (1998)","journal-title":"Journal of Circuits, Systems and Computers"},{"key":"11_CR17","unstructured":"Wimmel, H.: Entscheidbarkeit bei Petri Netzen. eXamen.press. Springer, Habilitation Thesis (2008)"},{"key":"11_CR18","unstructured":"Wimmel, H.: Sara \u2013 Structures for Automated Reachability Analysis (2010), http:\/\/service-technology.org\/tools\/download"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19835-9_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Wimmel","year":"2011","unstructured":"Wimmel, H., Wolf, K.: Applying CEGAR to the Petri Net State Equation. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, Springer, Heidelberg (2011)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-73094-1_5","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"K. Wolf","year":"2007","unstructured":"Wolf, K.: Generating Petri net state spaces. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol.\u00a04546, pp. 29\u201342. Springer, Heidelberg (2007)"},{"key":"11_CR21","unstructured":"Wolf, K.: LoLA \u2013 A low level analyzer (2010), http:\/\/www.informatik.uni-rostock.de\/~nl\/wiki\/tools\/lola"},{"issue":"11","key":"11_CR22","first-page":"2566","volume":"E82-A","author":"M. Yamauchi","year":"1999","unstructured":"Yamauchi, M., Watanabe, T.: Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net. IEICE Trans. Fundamentals\u00a0E82-A(11), 2566\u20132572 (1999)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"11","key":"11_CR23","first-page":"2558","volume":"E82-A","author":"M. Yamauchi","year":"1999","unstructured":"Yamauchi, M., Watanabe, T.: Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets. IEICE Trans. Fundamentals\u00a0E82-A(11), 2558\u20132565 (1999)","journal-title":"IEICE Trans. Fundamentals"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21834-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T08:24:46Z","timestamp":1560327886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21834-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642218330","9783642218347"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21834-7_11","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-21834-7","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}