{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T01:16:44Z","timestamp":1672622204158},"reference-count":39,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0304-3975(91)90228-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"341-372","source":"Crossref","is-referenced-by-count":25,"title":["A taxonomy of fairness and temporal logic problems for Petri nets"],"prefix":"10.1016","volume":"82","author":[{"given":"Rodney R.","family":"Howell","sequence":"first","affiliation":[]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90228-T_BIB1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","article-title":"Limits for automatic verification of finite-state concurrent systems","volume":"22","author":"Apt","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90228-T_BIB2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(83)90004-7","article-title":"Proof rules and transformations dealing with fairness","volume":"3","author":"Apt","year":"1983","journal-title":"Sci. Comput. Prog."},{"key":"10.1016\/0304-3975(91)90228-T_BIB3","first-page":"146","article-title":"Fair termination revisited with delay","author":"Apt","year":"1982","journal-title":"Proc. 2nd Conf. on Foundations of Software Technology and Theoretical Computer Science (FST-TCS)"},{"key":"10.1016\/0304-3975(91)90228-T_BIB4","article-title":"Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems","author":"Baker","year":"1973","journal-title":"MIT Project MAC, 1973, CSGM 79"},{"key":"10.1016\/0304-3975(91)90228-T_BIB5_1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(84)90114-5","article-title":"Fairness and conspiracies","volume":"18","author":"Best","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90228-T_BIB5_2","first-page":"162","article-title":"Fairness and conspiracies","volume":"19","author":"Best","year":"1984","journal-title":"addendum"},{"key":"10.1016\/0304-3975(91)90228-T_BIB6","series-title":"Reseaux de Petri: Th\u00e9orie et Pratique \u2014 Tome 1: Th\u00e9orie et Analyse","author":"Brams","year":"1983"},{"key":"10.1016\/0304-3975(91)90228-T_BIB7","series-title":"Proc. 4th Symp. on Theoretical Aspects of Computer Science","first-page":"396","article-title":"Decidability questions for fairness in Petri nets","volume":"247","author":"Carstensen","year":"1987"},{"key":"10.1016\/0304-3975(91)90228-T_BIB8","series-title":"Advances in Petri Nets 1984","first-page":"83","article-title":"Infinite behaviour and fairness in Petri nets","volume":"188","author":"Carstensen","year":"1985"},{"key":"10.1016\/0304-3975(91)90228-T_BIB9","first-page":"127","article-title":"Computable nondeterministic functions","author":"Chandra","year":"1978","journal-title":"Proc 19th IEEE Symp. on the Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90228-T_BIB10","series-title":"Workshop on Logics of Programs","first-page":"52","article-title":"Design and synthesis of synchronization skeletons using branching time temporal logic","volume":"131","author":"Clarke","year":"1981"},{"key":"10.1016\/0304-3975(91)90228-T_BIB11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","article-title":"Modalities for model checking: Branching time logic strikes back","volume":"8","author":"Emerson","year":"1987","journal-title":"Sci. Comput. Prog."},{"key":"10.1016\/0304-3975(91)90228-T_BIB12","unstructured":"D. Escrig, A collection of algorithms to decide liveness and other related properties of a place transition system, Unpublished manuscript, Dpto. Inform\u00e1tica y Autom\u00e1tica, Fac. Ciencias Matem\u00e1ticas, Universidad Complutense, 28040 Madrid, Spain."},{"key":"10.1016\/0304-3975(91)90228-T_BIB13","series-title":"Fairness","author":"Francez","year":"1986"},{"key":"10.1016\/0304-3975(91)90228-T_BIB14","doi-asserted-by":"crossref","first-page":"77","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."},{"key":"10.1016\/0304-3975(91)90228-T_BIB15","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/4904.4993","article-title":"Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness","volume":"33","author":"Harel","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90228-T_BIB16","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(89)90053-4","article-title":"Problems concerning fairness and temporal logic for conflict-free Petri nets","volume":"64","author":"Howell","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90228-T_BIB17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(86)90026-5","article-title":"Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states","volume":"46","author":"Howell","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90228-T_BIB18","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90228-T_BIB19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(90)90006-4","article-title":"Decidability of a temporal logic problem for Petri nets","volume":"74","author":"Jan\u010dar","year":"1990","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/0304-3975(91)90228-T_BIB20","first-page":"267","article-title":"Decidability of reachability in vector addition systems","author":"Kosaraju","year":"1982","journal-title":"Proc. 14th Annu. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90228-T_BIB21","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","article-title":"Decision problems for \u03c9-automata","volume":"3","author":"Landweber","year":"1969","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(91)90228-T_BIB22","series-title":"Proc. 8th Internat. Colloquium on Automata, Languages, and Programming","first-page":"264","article-title":"Impartiality, justice, and fairness: the ethics of concurrent termination","volume":"115","author":"Lehman","year":"1981"},{"key":"10.1016\/0304-3975(91)90228-T_BIB23","series-title":"Technical Report 62","article-title":"The Reachability Problem Requires Exponential Space","author":"Lipton","year":"1976"},{"key":"10.1016\/0304-3975(91)90228-T_BIB24","series-title":"Proc. 6th Internat. Colloquium on Automata, Languages, and Programming","first-page":"385","article-title":"The modal logic of programs","volume":"71","author":"Manna","year":"1979"},{"issue":"3","key":"10.1016\/0304-3975(91)90228-T_BIB25","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","article-title":"An algorithm for the general Petri net reachability problem","volume":"13","author":"Mayr","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90228-T_BIB26","first-page":"236","article-title":"Weak Petri net computers for Ackermann functions","volume":"21","author":"M\u00fcller","year":"1985","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"10.1016\/0304-3975(91)90228-T_BIB27","series-title":"Proc. STACS '84","first-page":"20","article-title":"Transformations realizing fairness assumptions for parallel programs","volume":"166","author":"Olderog","year":"1984"},{"key":"10.1016\/0304-3975(91)90228-T_BIB28","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/0304-3975(91)90228-T_BIB29","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977","journal-title":"Proc. 19th Annu. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90228-T_BIB30","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00265555","article-title":"Fairness and related properties in transition systems\u2014a temporal logic to deal with fairness","volume":"19","author":"Queille","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(91)90228-T_BIB31","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","article-title":"The covering and boundedness problems for vector addition systems","volume":"6","author":"Rackoff","year":"1978","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0304-3975(91)90228-T_BIB32","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","article-title":"A multiparameter analysis of the boundedness problem for vector addition systems","volume":"32","author":"Rosier","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90228-T_BIB33","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","article-title":"The complexity of propositional linear temporal logic","volume":"32","author":"Sistla","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90228-T_BIB34","series-title":"Proc. IEEE Symp. on Logic in Computer Science","first-page":"138","article-title":"Reasoning with many processes","author":"Sistla","year":"1987"},{"key":"10.1016\/0304-3975(91)90228-T_BIB35","first-page":"641","article-title":"Fundamental properties and applications of temporal Petri nets","author":"Suzuki","year":"1985","journal-title":"Proc. 19th Annu. Conf. on Information Sciences and Systems"},{"key":"10.1016\/0304-3975(91)90228-T_BIB36","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(91)90228-T_BIB37","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90228-T_BIB38","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/BF00289715","article-title":"The residue of vector sets with applications to decidability problems in Petri nets","volume":"21","author":"Valk","year":"1985","journal-title":"Acta Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190228T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190228T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:53:46Z","timestamp":1555113226000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190228T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["030439759190228T"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90228-t","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}