{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:01Z","timestamp":1725490201447},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678977"},{"type":"electronic","value":"9783540446187"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44618-4_30","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:38:51Z","timestamp":1188297531000},"page":"410-425","source":"Crossref","is-referenced-by-count":16,"title":["LP Deadlock Checking Using Partial Order Dependencies"],"prefix":"10.1007","author":[{"given":"Victor","family":"Khomenko","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,21]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"F. Ajili and E. Contejean: Complete Solving of Linear Diophantine Equations and Inequations Without Adding Variables. Proc. of 1st International Conference on principles and practice of Constraint Programming, Cassis (1995) 1\u201317.","DOI":"10.1007\/3-540-60299-2_1"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(96)00195-8","volume":"173","author":"F. Ajili","year":"1997","unstructured":"F. Ajili and E. Contejean: Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations. Theoretical Comp. Sci. 173 (1997) 183\u2013208.","journal-title":"Theoretical Comp. Sci."},{"key":"30_CR3","series-title":"Lect Notes Comput Sci","first-page":"397","volume-title":"Proc. of TACAS\u201996: Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Best","year":"1996","unstructured":"E. Best and B. Grahlmann: PEP \u2014 more than a Petri Net Tool. Proc. of TACAS\u201996: Tools and Algorithms for the Construction and Analysis of Systems, Margaria T., Steffen B. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1055 (1996) 397\u2013401."},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke, E. A. Emerson and A. P. Sistla: Automatic Verification of Finite-state Concurrent Systems Using Temporal Logic Specifications. ACM TOPLAS 8 (1986) 244\u2013263.","journal-title":"ACM TOPLAS"},{"key":"30_CR5","unstructured":"E. Contejean: Solving Linear Diophantine Constraints Incrementally. Proc. of 10th Int. Conf. on Logic Programming, D. S. Warren (Ed.). MIT Press (1993) 532\u2013549."},{"key":"30_CR6","unstructured":"E. Contejean and H. Devie: Solving Systems of Linear Diophantine Equations. Proc. of 3rd Workshop on Unification, University of Keiserlautern (1989)."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1994.1067","volume":"113","author":"E. Contejean","year":"1994","unstructured":"E. Contejean and H. Devie: An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations. Inf. and Computation 113 (1994) 143\u2013172.","journal-title":"Inf. and Computation"},{"key":"30_CR8","unstructured":"CPLEX Corporation: CPLEX 3.0. Manual (1995)."},{"key":"30_CR9","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. Acta Inf. 28 (1991) 575\u2013591.","journal-title":"Acta Inf"},{"key":"30_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"Proc. of TACAS\u201996: Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Esparza","year":"1996","unstructured":"J. Esparza, S. R\u00f6mer and W. Vogler: An Improvement of McMillan\u2019s Unfolding Algorithm. Proc. of TACAS\u201996: Tools and Algorithms for the Construction and Analysis of Systems, Margaria T., Steffen B. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1055 (1996) 87\u2013106."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J. Esparza","year":"1994","unstructured":"J. Esparza: Model Checking Based on Branching Processes. Science of Computer Programming 23 (1994) 151\u2013195.","journal-title":"Science of Computer Programming"},{"key":"30_CR12","unstructured":"V. Khomenko and M. Koutny: Deadlock Checking Using Liner Programming and Partial Order Dependencies. Teachnical Report CS-TR-695, Department of Computing Science, University of Newcastle (2000)."},{"key":"30_CR13","first-page":"12","volume":"4","author":"S. Krivoi","year":"1999","unstructured":"S. Krivoi: About Some Methods of Solving and Feasibility Criteria of Linear Diophantine Equations over Natural Numbers Domain (in Russian). Cybernetics and System Analysis 4 (1999) 12\u201336.","journal-title":"Cybernetics and System Analysis"},{"key":"30_CR14","series-title":"Lect Notes Comput Sci","first-page":"164","volume-title":"Proc. of CAV\u201992","author":"K. L. McMillan","year":"1992","unstructured":"K. L. McMillan: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. Proc. of CAV\u201992, Springer-Verlag, Lecture Notes in Computer Science 663 (1992) 164\u2013174."},{"key":"30_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-63166-6_35","volume-title":"Proc. of CAV\u201997","author":"S. Melzer","year":"1997","unstructured":"S. Melzer and S. R\u00f6mer: Deadlock Checking Using Net Unfoldings. Proc. of CAV\u201997, O. Grumberg (Ed.). Springer-Verlag, Lecture Notes in Computer Science 1254 (1997) 352\u2013363."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2000 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44618-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T23:25:58Z","timestamp":1550877958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44618-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678977","9783540446187"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44618-4_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}