{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:05:35Z","timestamp":1774915535655,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540152040","type":"print"},{"value":"9783540393207","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15204-0_6","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:17:34Z","timestamp":1330193854000},"page":"83-100","source":"Crossref","is-referenced-by-count":16,"title":["Infinite behaviour and fairness in petri nets"],"prefix":"10.1007","author":[{"given":"Heino","family":"Carstensen","sequence":"first","affiliation":[]},{"given":"R\u00fcdiger","family":"Valk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"6_CR1","unstructured":"E.Best; Why Three Philosophers are different from Five Philosophers; BEGRUND-11, GMD (ISF), 1982. An Equivalent Result on \u2018Fairness'; BEGRUND-19 and BEGRUND-20, GMD (ISF), 1983"},{"key":"6_CR2","unstructured":"H.Carstensen; Fairne\u00df bei Petrinetzen mit unendlichem Verhalten; Bericht Nr. 93, Fachbereich Informatik, Universit\u00e4t Hamburg, 1982"},{"key":"6_CR3","unstructured":"H. Carstensen; Fairness Criteria that Guarantee Infinite Firing of Transitions; Mitteilung Nr. 109, Fachbereich Informatik, Universit\u00e4t Hamburg, 1983."},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0022-0000(77)80004-4","volume":"15","author":"R. S. Cohen","year":"1977","unstructured":"R.S. Cohen,A.Y. Gold; Theory of \u03c9-Languages, Part I: Characterization of \u03c9-Context-Free Languages, Part II: A Study of Various Models of \u03c9-Type Generation and Recognition; J.Compt.System Sci. 15(1977) 169\u2013208.","journal-title":"J.Compt.System Sci."},{"key":"6_CR5","volume-title":"Automata, Languages and Machines, Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg; Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"H.J.Genrich,E.Stankiewics-Wichno; A Dictionary of some Basic Notations of Net Theory; in Brauer (ed.) Net Theory and Applications, LNCS Vol. 84, 1980.","DOI":"10.1007\/3-540-10001-6_39"},{"key":"6_CR7","unstructured":"R.M.Hack;Petri Net Languages; MIT, Project MAC, Computer Structure Group, Memo 124, 1975."},{"key":"6_CR8","series-title":"Tech.Rep.","volume-title":"Finite Tree Automata and \u03c9-automata","author":"R. Hossley","year":"1972","unstructured":"R. Hossley; Finite Tree Automata and \u03c9-automata; MIT,MAC, Tech.Rep. 102, Cambridge Mass., 1972."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"M.Jantzen,R.Valk; Formal Properties of Place\/Transition Nets; in Brauer (ed.), Net Theory and Applications, LNCS Vol. 84, 1980.","DOI":"10.1007\/3-540-10001-6_23"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. M. Karp","year":"1969","unstructured":"R.M. Karp,R.E. Miller; Parallel Program Schemata; J.Compt.System Sci. 3(1969) 147\u2013195.","journal-title":"J.Compt.System Sci."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L. H. Landweber","year":"1969","unstructured":"L.H. Landweber; Decision Problems for \u03c9-automata; Math.Syst. Theory 3(1969) 376\u2013384.","journal-title":"Math.Syst. Theory"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"D.Lehmann,A.Pneuli,J.Stavi; Impartiality, Justice, Fairness: The Ethics of Concurrent Termination; Automata, Languages, Programming, 8th Colloquium, LNCS Vol. 115, 1981.","DOI":"10.1007\/3-540-10843-2_22"},{"key":"6_CR13","unstructured":"M.Nivat; On the Synchronisation of Processes; INRIA, Rap.Rech. No 3 1980."},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(83)90115-9","volume":"25","author":"R. Valk","year":"1983","unstructured":"R. Valk; Infinite Behaviour of Petri Nets; Theor.Comp.Sci. 25(1983) 311\u2013341.","journal-title":"Theor.Comp.Sci."},{"key":"6_CR15","unstructured":"R.Valk,M.Jantzen; The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets, in this volume. also Bericht Nr. 101, Fachbereich Informatik, Univ. Hamburg."},{"key":"6_CR16","unstructured":"G.Vidal-Naquet; R\u00e9seaux de Petri D\u00e9terministes,Th\u00e8se d'Etat, Univ. Paris VI, 1981."}],"container-title":["Lecture Notes in Computer Science","Advances in Petri Nets 1984"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15204-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:18Z","timestamp":1605643698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15204-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540152040","9783540393207"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-15204-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985]]}}}