{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:50:43Z","timestamp":1761486643738},"reference-count":43,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0166-218x(90)90144-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"195-210","source":"Crossref","is-referenced-by-count":20,"title":["Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems"],"prefix":"10.1016","volume":"29","author":[{"given":"M.","family":"Minoux","sequence":"first","affiliation":[]},{"given":"K.","family":"Barkaoui","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90144-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(90)90144-2_BIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(90)90144-2_BIB3","article-title":"Contribution aux m\u00e9thodes d'analyse des r\u00e9seaux de Petri par la th\u00e9orie des graphes","volume":"VI","author":"Barkaoui","year":"1988"},{"issue":"3","key":"10.1016\/0166-218X(90)90144-2_BIB4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1051\/ro\/1987210302191","article-title":"Composantes pr\u00e9conservatives minimales d'un r\u00e9seau de Petri: \u00e9tude structurelle","volume":"21","author":"Barkaoui","year":"1987","journal-title":"RAIRO"},{"key":"10.1016\/0166-218X(90)90144-2_BIB5","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1970"},{"key":"10.1016\/0166-218X(90)90144-2_BIB6","series-title":"Graph Theory and its Applications to Algorithms and Computer Science","first-page":"73","article-title":"A graph theoretical characterization of minimal deadlocks in Petri nets","author":"Bermond","year":"1985"},{"key":"10.1016\/0166-218X(90)90144-2_BIB7","series-title":"Tomes 1 et 2","article-title":"R\u00e9seaux de Petri: th\u00e9orie et pratique","author":"Brams","year":"1982"},{"key":"10.1016\/0166-218X(90)90144-2_BIB8","article-title":"Les r\u00e9seaux de Petri temporis\u00e9s","volume":"VI","author":"Chretienne","year":"1983"},{"key":"10.1016\/0166-218X(90)90144-2_BIB9","series-title":"Deadlocks in Petri nets","author":"Commoner","year":"1972"},{"key":"10.1016\/0166-218X(90)90144-2_BIB10","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","article-title":"Marked directed graphs","volume":"5","author":"Commoner","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90144-2_BIB11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971","journal-title":"Proceedings 3rd ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90144-2_BIB12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear time algorithms for testing the satisfiability of propositional Horn formulae","volume":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0166-218X(90)90144-2_BIB13","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90144-2_BIB14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0743-1066(87)90015-X","article-title":"Hornlog: a graph-based interpreter for general Horn clauses","volume":"4","author":"Gallier","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0166-218X(90)90144-2_BIB15","series-title":"Application and Theory of Petri Nets","year":"1982"},{"key":"10.1016\/0166-218X(90)90144-2_BIB16","series-title":"Graphes et Algorithmes","author":"Gondran","year":"1979"},{"key":"10.1016\/0166-218X(90)90144-2_BIB17","series-title":"TUM-INFO-7906","article-title":"Lebendikeit in NSK-Petri-Netzen","author":"Griese","year":"1979"},{"key":"10.1016\/0166-218X(90)90144-2_BIB18","series-title":"M.S. Thesis","article-title":"Analysis of production schemata by Petri nets","author":"Hack","year":"1972"},{"key":"10.1016\/0166-218X(90)90144-2_BIB19","series-title":"CSE-memo 78-1","article-title":"Extended state machine allocatable nets, an extension of free-choice Petri net results","author":"Hack","year":"1973"},{"issue":"1","key":"10.1016\/0166-218X(90)90144-2_BIB20","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(76)90008-6","article-title":"The equality problem for vector addition systems is undecidable","volume":"2","author":"Hack","year":"1976","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0166-218X(90)90144-2_BIB21","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321850.321857","article-title":"Unit refutations and Horn sets","volume":"21","author":"Henschen","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90144-2_BIB22","series-title":"Events and conditions","author":"Holt","year":"1970"},{"key":"10.1016\/0166-218X(90)90144-2_BIB23","first-page":"413","article-title":"Complexity of place\u29f8transition nets","volume":"254","author":"Jantzen","year":"1987"},{"key":"10.1016\/0166-218X(90)90144-2_BIB24","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(90)90144-2_BIB25","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","article-title":"Complexity of some problems in Petri nets","volume":"4","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(90)90144-2_BIB26","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(90)90144-2_BIB27","series-title":"Information Processing","first-page":"187","article-title":"Use of Petri nets for proving correctness of concurrent process systems","author":"Lautenbach","year":"1974"},{"key":"10.1016\/0166-218X(90)90144-2_BIB28","series-title":"TR-62","article-title":"The reachability problem and the boundedness problem for Petri nets are exponential-space hard","author":"Lipton","year":"1976"},{"key":"10.1016\/0166-218X(90)90144-2_BIB29","article-title":"Fuites et semi-flots dans les reseaux de Petri","volume":"VI","author":"Memmi","year":"1978"},{"key":"10.1016\/0166-218X(90)90144-2_BIB30","article-title":"M\u00e9thodes d'analyse des r\u00e9seaux de Petri, r\u00e9seaux \u00e0 files, application aux syst\u00e8mes en temps r\u00e9el","volume":"VI","author":"Memmi","year":"1983"},{"key":"10.1016\/0166-218X(90)90144-2_BIB31","article-title":"Linear algebra in net theory","volume":"84","author":"Memmi","year":"1980"},{"key":"10.1016\/0166-218X(90)90144-2_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(88)90124-X","article-title":"LTUR: A simplified linear-time unit resolution algorithm for Horn formulae with computer implementation","volume":"29","author":"Minoux","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(90)90144-2_BIB33","series-title":"International Symposium on Pseudoboolean optimization and related areas","article-title":"Polynomial algorithms for finding deadlocks, traps and other substructures relevant to Petri net analysis","author":"Minoux","year":"1987"},{"key":"10.1016\/0166-218X(90)90144-2_BIB34","article-title":"Polynomial algorithms for proving or disproving Commoner's property in Petri nets","author":"Minoux","year":"1988","journal-title":"Proceedings 9th Workshop on Theory and Applications of Petri Nets"},{"issue":"3","key":"10.1016\/0166-218X(90)90144-2_BIB35","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356698.356702","article-title":"Petri nets","volume":"9","author":"Peterson","year":"1977","journal-title":"Comput. Surveys"},{"key":"10.1016\/0166-218X(90)90144-2_BIB36","series-title":"Petri Net Theory and the Modelling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/0166-218X(90)90144-2_BIB37","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(80)90049-6","article-title":"A switching algorithm for the solution of quadratic boolean equations","volume":"11","author":"Petreschi","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(90)90144-2_BIB38","series-title":"Kommunikation mit Automaten","author":"Petri","year":"1962"},{"key":"10.1016\/0166-218X(90)90144-2_BIB39","article-title":"Introduction to general net theory of processes and Systems","volume":"84","author":"Petri","year":"1980"},{"key":"10.1016\/0166-218X(90)90144-2_BIB40","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF00264434","article-title":"Deterministic buffer synchronization of sequential processes","volume":"18","author":"Reisig","year":"1982","journal-title":"Acta Informatica"},{"key":"10.1016\/0166-218X(90)90144-2_BIB41","series-title":"Th\u00e8se Doct. Etat","article-title":"Le controle des syst\u00e8mes asynchrones: concepts, propri\u00e9t\u00e9s, analyse statistique","author":"Sifakis","year":"1979"},{"key":"10.1016\/0166-218X(90)90144-2_BIB42","article-title":"Algorithmes d'analyse structurelle des r\u00e9seaux de Petri","volume":"VI","author":"Toudic","year":"1981"},{"issue":"1","key":"10.1016\/0166-218X(90)90144-2_BIB43","first-page":"137","article-title":"Algorithmes d'algebre lin\u00e9aire pour l'analyse structurelle des r\u00e9seaux de Petri","volume":"14","author":"Toudic","year":"1982","journal-title":"Rev. Technique THOMSON-CSF"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X90901442?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X90901442?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:47Z","timestamp":1555135067000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X90901442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":43,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0166218X90901442"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90144-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}