{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:57Z","timestamp":1725664017541},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540568636"},{"type":"electronic","value":"9783540477594"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56863-8_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:42:51Z","timestamp":1330256571000},"page":"319-338","source":"Crossref","is-referenced-by-count":14,"title":["Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net"],"prefix":"10.1007","author":[{"given":"Peter","family":"Kemper","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"19_CR1","series-title":"LNCS 616","doi-asserted-by":"crossref","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":"K. Barkaoui and M. Minoux. A polynomial-time graph algorithm to decide liveness of some basic classes of bounded petri nets. In K. Jensen, editor, Application and Theory of Petri Nets 1992, LNCS 616, pages 62\u201375, Berlin Heidelberg, 1992. Springer."},{"key":"19_CR2","unstructured":"F. Bause and P. Kemper. QPN-Tool Version 1.0 User's Guide. Universit\u00e4t Dortmund, LS Informatik 4, 1991."},{"key":"19_CR3","series-title":"LNCS 159","first-page":"141","volume-title":"CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila","author":"E. Best","year":"1983","unstructured":"E. Best and M.W. Shields. Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets. In CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, LNCS 159, pages 141\u2013154, Berlin Heidelberg, 1983. Springer."},{"key":"19_CR4","unstructured":"J. Esparza. Minimal deadlocks in free choice nets. Hildesheimer Informatikberichte 1\/89, Universit\u00e4t Hildesheim, Institut f\u00fcr Informatik, 1989."},{"key":"19_CR5","series-title":"LNCS 458","first-page":"182","volume-title":"Concur '90","author":"J. Esparza","year":"1990","unstructured":"J. Esparza. Synthesis rules for petri nets, and how they lead to new results. In J.C.M. Baeten and J.W. Klop, editors, Concur '90, LNCS 458, pages 182\u2013198, Berlin Heidelberg, 1990. Springer."},{"key":"19_CR6","volume-title":"Technical Report TR-94","author":"M.H.T. Hack","year":"1972","unstructured":"M.H.T. Hack. Analysis of production schemata by petri nets. Technical Report TR-94, MIT, Boston, 1972 corrected 1974."},{"key":"19_CR7","series-title":"LNCS 616","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-55676-1_15","volume-title":"Application and Theory of Petri Nets 1992","author":"P. Kemper","year":"1992","unstructured":"P. Kemper and F. Bause. An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets. In K. Jensen, editor, Application and Theory of Petri Nets 1992, LNCS 616, pages 263\u2013278, Berlin Heidelberg, 1992. Springer."},{"key":"19_CR8","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science. Springer, Berlin Heidelberg, 1984."},{"key":"19_CR9","volume-title":"Technical Report 212","author":"M. Minoux","year":"1988","unstructured":"M. Minoux and K. Barkaoui. Polynomial algorithm for finding deadlocks, traps and other substructures relevant to petri net analysis. Technical Report 212, Laboratoire MASI, Universit\u00e9 P. et M. Curie, Paris, 1988."},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan. Depth-first search and linear graph algorithms. In SIAM. Jour. Comput, volume 1, pages 146\u2013160. 1972.","journal-title":"SIAM. Jour. Comput"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56863-8_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:56:27Z","timestamp":1619571387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56863-8_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540568636","9783540477594"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-56863-8_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}