{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:34:34Z","timestamp":1648755274126},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":8174,"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,3]]},"DOI":"10.1016\/0304-3975(91)90206-h","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"77-104","source":"Crossref","is-referenced-by-count":1,"title":["Global and local views of state fairness"],"prefix":"10.1016","volume":"80","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":"78","reference":[{"key":"10.1016\/0304-3975(91)90206-H_BIB1_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)90206-H_BIB1_2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0020-0190(84)90097-8","article-title":"Addendum","volume":"19","author":"Best","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90206-H_BIB2","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1109\/TCOM.1980.1094685","article-title":"Formal methods in communication protocol design","author":"Bochmann","year":"1980","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0304-3975(91)90206-H_BIB3","series-title":"Proc. 4th Ann. 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)90206-H_BIB4","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)90206-H_BIB5","first-page":"127","article-title":"Computable nondeterministic functions","author":"Chandra","year":"1978","journal-title":"Proc. 19th IEEE Symp. on Foundations of Computer Science"},{"issue":"1","key":"10.1016\/0304-3975(91)90206-H_BIB6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90206-H_BIB7","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)90206-H_BIB8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","article-title":"Modalitics for model checking: branching time logic strikes back","volume":"8","author":"Emerson","year":"1987","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(91)90206-H_BIB9","first-page":"268","article-title":"A model-theoretical analysis of knowledge","author":"Fagin","year":"1984","journal-title":"Proc. 25th IEEE Symp. on Foundations of Computer Science"},{"issue":"1","key":"10.1016\/0304-3975(91)90206-H_BIB10","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1145\/5001.5002","article-title":"Proving liveness for networks of communicating finite state machines","volume":"8","author":"Gouda","year":"1986","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/0304-3975(91)90206-H_BIB11","series-title":"MAC TR-94","article-title":"Analysis of production schemata by Petri nets","author":"Hack","year":"1972"},{"key":"10.1016\/0304-3975(91)90206-H_BIB12","first-page":"50","article-title":"Knowledge and common knowledge in a distributed environment","author":"Halpern","year":"1984","journal-title":"Proc. 3rd ACM Symp. on Principles of Distributed Computing"},{"issue":"3","key":"10.1016\/0304-3975(91)90206-H_BIB13","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/2166.357214","article-title":"Termination of probabilistic concurrent programs","volume":"5","author":"Hart","year":"1983","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/0304-3975(91)90206-H_BIB14","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(91)90206-H_BIB15","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)90206-H_BIB16","unstructured":"R. Howell, L. Rosier and H. Yen, A taxonomy of fairness and temporal logic problems for Petri nets, to appear in Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90206-H_BIB17","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\/0304-3975(91)90206-H_BIB18","first-page":"23","article-title":"On the analysis of cooperation and antagonism in networks of communicating processes","author":"Kanellakis","year":"1985","journal-title":"Proc. 4th ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(91)90206-H_BIB19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90206-H_BIB20","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(80)90033-1","article-title":"The complexity of problems in systems of communicating sequential processes","volume":"21","author":"Ladner","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90206-H_BIB21","first-page":"62","article-title":"Knowledge, common knowledge and related puzzles","author":"Lehmann","year":"1984","journal-title":"Proc. 3rd ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(91)90206-H_BIB22","first-page":"133","article-title":"On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem","author":"Lehmann","year":"1981","journal-title":"Proc. 10th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(91)90206-H_BIB23","series-title":"Proc. 8th Internat. Coll. on Automata, Languages and Programming","first-page":"264","article-title":"Impartiality, justice and fairness: the ethics of concurrent termination","volume":"115","author":"Lehmann","year":"1981"},{"key":"10.1016\/0304-3975(91)90206-H_BIB24","article-title":"The reachability problem requires exponential space","volume":"62","author":"Lipton","year":"1976"},{"key":"10.1016\/0304-3975(91)90206-H_BIB25","first-page":"141","article-title":"How to cook a temporal proof system for your pet language","author":"Manna","year":"1983","journal-title":"Proc. 10th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(91)90206-H_BIB26","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/0304-3975(91)90206-H_BIB27","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/0304-3975(91)90206-H_BIB28","first-page":"278","article-title":"On the extremely fair treatment of probabilistic algorithms","author":"Pnueli","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90206-H_BIB29","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)90206-H_BIB30","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00288965","article-title":"The choice coordination problem","volume":"17","author":"Rabin","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(91)90206-H_BIB31","first-page":"407","article-title":"N-process synchronization by 4 \u2217 log2 n-valued shared variable","author":"Rabin","year":"1980","journal-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90206-H_BIB32","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."},{"key":"10.1016\/0304-3975(91)90206-H_BIB33","first-page":"288","article-title":"Universal games of incomplete information","author":"Reif","year":"1979","journal-title":"Proc. 11th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90206-H_BIB34","series-title":"Petri Nets\u2014An Introduction","author":"Reisig","year":"1985"},{"key":"10.1016\/0304-3975(91)90206-H_BIB35","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1987"},{"key":"10.1016\/0304-3975(91)90206-H_BIB36","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(88)90031-X","article-title":"On the complexity of deciding fair termination of probabilistic concurrent finite-state programs","volume":"58","author":"Rosier","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90206-H_BIB37","first-page":"138","article-title":"Reasoning with many processes","author":"Sistla","year":"1987","journal-title":"Proc. IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(91)90206-H_BIB38","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)90206-H_BIB39","first-page":"327","article-title":"Automatic verification of probabilistic concurrent finite-state programs","author":"Vardi","year":"1985","journal-title":"Proc. 26th Ann. Symp. on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190206H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190206H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:21:19Z","timestamp":1555179679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190206H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["030439759190206H"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90206-h","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}