{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:24Z","timestamp":1725456264108},"publisher-location":"Berlin\/Heidelberg","reference-count":21,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354050110X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017158","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:30:09Z","timestamp":1132727409000},"page":"351-359","source":"Crossref","is-referenced-by-count":6,"title":["A taxonomy of fairness and temporal logic problems for petri nets"],"prefix":"10.1007","author":[{"given":"Rodney R.","family":"Howell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(84)90114-5","volume":"18","author":"E. Best","year":"1984","unstructured":"E. Best. Fairness and conspiracies. Information Processing Letters, 18:215\u2013220, 1984. Addendum, Vol. 19, page 162, 1984.","journal-title":"Information Processing Letters"},{"key":"32_CR2","volume-title":"Reseaux de Petri: Theorie et Pratique \u2014 Tome 1: Theorie et Analyse","author":"G. Brams","year":"1983","unstructured":"G. Brams. Reseaux de Petri: Theorie et Pratique \u2014 Tome 1: Theorie et Analyse. Masson, Paris, 1983."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"H. Carstensen. Decidability questions for fairness in Petri nets. In Proceedings of the 4th Symposium on Theoretical Aspects of Computer Science, pages 396\u2013407, 1987. LNCS 247.","DOI":"10.1007\/BFb0039622"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"H. Carstensen and R. Valk. Infinite behaviour and fairness in Petri nets. In Advances in Petri Nets 1984, pages 83\u2013100, Springer-Verlag, 1985. LNCS 188.","DOI":"10.1007\/3-540-15204-0_6"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"A. Chandra. Computable nondeterministic functions. In Proceedings of the 19th IEEE Symposium on the Foundations of Computer Science, pages 127\u2013131, 1978.","DOI":"10.1109\/SFCS.1978.10"},{"key":"32_CR6","unstructured":"D. Escrig. A collection of algorithms to decide liveness and other related properties of a place transition system. Unpublished manuscript."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"N. Francez. Fairness. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"32_CR8","unstructured":"R. Howell and L. Rosier. On questions of fairness and temporal logic for conflict-free Petri nets. In Proceedings of the 8th European Workshop on Applications and Theory of Petri Nets, pages 197\u2013214, 1987."},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(86)90026-5","volume":"46","author":"R. Howell","year":"1986","unstructured":"R. Howell, L. Rosier, D. Huynh, and H. Yen. Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states. Theoret. Comp. Sci., 46:107\u2013140, 1986.","journal-title":"Theoret. Comp. Sci."},{"key":"32_CR10","unstructured":"R. Howell, L. Rosier, and H. Yen. A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. Technical Report 88-03, Department of Computer Sciences, The University of Texas at Austin, Austin, Texas 78712, 1988."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"R. Kosaraju. Decidability of reachability in vector addition systems. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pages 267\u2013280, 1982.","DOI":"10.1145\/800070.802201"},{"key":"32_CR12","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L. Landweber","year":"1969","unstructured":"L. Landweber. Decision problems for \u03c9-automata. Math. Syst. Theory, 3:376\u2013384, 1969.","journal-title":"Math. Syst. Theory"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness: the ethics of concurrent termination. In Proceedings of the 8th International Colloquium on Automata, Languages, and Programming, pages 264\u2013277, 1981. LNCS 115.","DOI":"10.1007\/3-540-10843-2_22"},{"key":"32_CR14","unstructured":"R. Lipton. The Reachability Problem Requires Exponential Space. Technical Report 62, Yale University, Dept. of CS., Jan. 1976."},{"issue":"3","key":"32_CR15","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"E. Mayr. An algorithm for the general Petri net reachability problem. SIAM J. Comput., 13(3):441\u2013460, 1984. A preliminary version of this paper was presented at the 13th Annual Symposium on Theory of Computing, 1981.","journal-title":"SIAM J. Comput."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"H. M\u00fcller. The reachability problem for VAS. In Advances in Petri Nets, pages 376\u2013391, Springer-Verlag, 1985. LNCS 188.","DOI":"10.1007\/3-540-15204-0_21"},{"key":"32_CR17","volume-title":"Petri Net Theory and the Modeling of Systems","author":"J. Peterson","year":"1981","unstructured":"J. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall, Englewood Cliffs, NJ, 1981."},{"key":"32_CR18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00265555","volume":"19","author":"J. Queille","year":"1983","unstructured":"J. Queille and J. Sifakis. Fairness and related properties in transition systems \u2014 a temporal logic to deal with fairness. Acta Informatica, 19:195\u2013220, 1983.","journal-title":"Acta Informatica"},{"key":"32_CR19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"C. Rackoff. The covering and boundedness problems for vector addition systems. Theoret. Comp. Sci., 6:223\u2013231, 1978.","journal-title":"Theoret. Comp. Sci."},{"issue":"1","key":"32_CR20","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","volume":"32","author":"L. Rosier","year":"1986","unstructured":"L. Rosier and H. Yen. A multiparameter analysis of the boundedness problem for vector addition systems. J. of Computer and System Sciences, 32(1):105\u2013135, 1986.","journal-title":"J. of Computer and System Sciences"},{"key":"32_CR21","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/BF00289715","volume":"21","author":"R. Valk","year":"1985","unstructured":"R. Valk and M. Jantzen. The residue of vector sets with applications to decidability problems in Petri nets. Acta Informatica, 21:643\u2013674, 1985.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1988"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0017158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:26:21Z","timestamp":1586579181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354050110X"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0017158","relation":{},"subject":[]}}