{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:34Z","timestamp":1763467834990},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657033"},{"type":"electronic","value":"9783540490593"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49059-0_17","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:56:57Z","timestamp":1194991017000},"page":"240-254","source":"Crossref","is-referenced-by-count":10,"title":["Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets"],"prefix":"10.1007","author":[{"given":"Keijo","family":"Heljanko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,3,12]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"E. Best. Partial order verification with PEP. In G. Holzmann, D. Peled, and V. Pratt, editors, Proceedings of POMIV\u201996, Workshop on Partial Order Methods in Verification. American Mathematical Society, July 1996.","DOI":"10.1090\/dimacs\/029\/17"},{"key":"17_CR2","unstructured":"J. C. Corbett. Evaluating deadlock detection methods for concurrent software. Technical report, Department of Information and Computer Science, University of Hawaii at Manoa, 1995."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet. Branching processes of Petri nets. In Acta Informatica 28, pages 575\u2013591, 1991.","journal-title":"Acta Informatica"},{"issue":"3","key":"17_CR4","first-page":"143","volume":"30","author":"J. Esparza","year":"1994","unstructured":"J. Esparza and M. Nielsen. Decidability issues for Petri Nets-a survey. Journal of Information Processing and Cybernetics 30(3), pages 143\u2013160, 1994.","journal-title":"Journal of Information Processing and Cybernetics"},{"key":"17_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"Proceedings of Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201996)","author":"J. Esparza","year":"1996","unstructured":"J. Esparza, S. R\u00f6mer, and W. Vogler. An improvement of McMillan\u2019s unfolding algorithm. In Proceedings of Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201996), pages 87\u2013106, Passau, Germany, Mar 1996. Springer-Verlag. LNCS 1055."},{"key":"17_CR6","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, pages 1070\u20131080, Seattle, USA, August 1988. The MIT Press."},{"key":"17_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/3-540-63166-6_43","volume-title":"Proceedings of CAV\u201997 (Computer Aided Verification)","author":"B. Grahlmann","year":"1997","unstructured":"B. Grahlmann. The PEP Tool. In Proceedings of CAV\u201997 (Computer Aided Verification), pages 440\u2013443. Springer-Verlag, June 1997. LNCS 1254."},{"key":"17_CR8","unstructured":"K. Heljanko. Deadlock checking for complete finite prefixes using logic programs with stable model semantics (extended abstract). In Proceedings of the Workshop Concurrency, Specification &Programming 1998. Humboldt-University, Berlin, September 1998. Accepted for publication. Available at http:\/\/ saturn.hut.fi\/~kepa\/publications\/KH csp98.ps.gz ."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"W. Marek and M. Truszczy\u0144ski. Autoepistemic logic. Journal of the ACM, 38:588\u2013619, 1991.","journal-title":"Journal of the ACM"},{"key":"17_CR10","series-title":"Lect Notes Comput Sci","first-page":"164","volume-title":"Proceeding of 4th Workshop on Computer Aided Verification (CAV\u201992)","author":"K. L. McMillan","year":"1992","unstructured":"K. L. McMillan. Using unfoldings to avoid the state space explosion problem in the verification of asynchronous circuits. In Proceeding of 4th Workshop on Computer Aided Verification (CAV\u201992), pages 164\u2013174, 1992. LNCS 663."},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"K. L. McMillan","year":"1995","unstructured":"K. L. McMillan. A technique of a state space search based on unfolding. In Formal Methods is System Design 6(1), pages 45\u201365, 1995.","journal-title":"Formal Methods is System Design"},{"key":"17_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-63166-6_35","volume-title":"Proceeding of 9th International Conference on Computer Aided Verification (CAV\u201997)","author":"S. Melzer","year":"1997","unstructured":"S. Melzer and S. R\u00f6mer. Deadlock checking using net unfoldings. In Proceeding of 9th International Conference on Computer Aided Verification (CAV\u201997), pages 352\u2013363, Haifa, Israel, Jun 1997. Springer-Verlag. LNCS 1254."},{"key":"17_CR13","unstructured":"I. Niemel\u00e4. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72\u201379, Trento, Italy, May 1998. Helsinki University of Technology, Digital Systems Laboratory, Research Report A52."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4 and P. Simons. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 420\u2013429, Dagstuhl, Germany, July 1997. Springer-Verlag.","DOI":"10.1007\/3-540-63255-7_32"},{"key":"17_CR15","unstructured":"P. Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Research Report A47, Helsinki University of Technology, Espoo, Finland, August 1997. Licenciate\u2019s thesis, Available at http:\/\/ saturn.hut.fi\/pub\/reports\/A47.ps.gz ."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1992","unstructured":"A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design, 1 (1992):297\u2013322.","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49059-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T18:15:24Z","timestamp":1684088124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49059-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657033","9783540490593"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-49059-0_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}