{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T23:51:38Z","timestamp":1670284298041},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540160786","type":"print"},{"value":"9783540397588","type":"electronic"}],"license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-16078-7_62","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:36:55Z","timestamp":1330195015000},"page":"21-36","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Temporal reasoning under generalized fairness constraints"],"prefix":"10.1007","author":[{"given":"E.","family":"Allen Emerson","sequence":"first","affiliation":[]},{"given":"Chin-Laung","family":"Lei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"2_CR1","unstructured":"Abrahamson, K., Decidability and Expressiveness of Logics of Processes, PhD Thesis, University of Washington, 1980."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(83)90004-7","volume":"3","author":"K. R. Apt","year":"1983","unstructured":"Apt, K. R., Olderog, E. R. Proof Rules and Translations Dealing with Fairness, Science of Computer Programming 3 (1983), pp. 65\u2013100.","journal-title":"Science of Computer Programming"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Ari, M., Manna, Z., and Pnueli, A., The Temporal Logic of Branching Time, 8th Annual ACM Symp. on Principles of Programming Languages, 1981.","DOI":"10.1145\/567532.567551"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Clarke, E. M., Emerson, E. A., and Sistla, A. P., Automatic Verification of Finite State Concurrent System Using Temporal Logic, 10th Annual ACM 10th Annual ACM Symp. on Principles of Programming Languages, 1983.","DOI":"10.1145\/567067.567080"},{"key":"2_CR5","volume-title":"Mathematical Theory of Program Correctness","author":"J. W. DeBakker","year":"1980","unstructured":"DeBakker, J. W., Mathematical Theory of Program Correctness (Prentice-Hall, Englewood Cliffs, NJ, 1980)."},{"key":"2_CR6","first-page":"169","volume":"85","author":"E. A. Emerson","year":"1980","unstructured":"Emerson, E. A., and Clarke, E. M., Characterizing Correctness Properties of Parallel Programs Using Fixpoints, Proc. ICALP 80, LNCS Vol. 85, Springer Verlag, 1980, pp. 169\u2013181.","journal-title":"Proc. ICALP 80, LNCS"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Emerson, E. A., and Clarke, E. M., Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons, Tech. Report TR-208, Univ. of Texas, 1982.","DOI":"10.1016\/0167-6423(83)90017-5"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Emerson, E. A., and Halpern, J. Y., Decision Procedures and Expressiveness in the Temporal Logic of Branching Time, 14th Annual ACM Symp. on Theory of Computing, 1982.","DOI":"10.1145\/800070.802190"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Emerson, E. A., and Halpern, J. Y., \"Sometimes\" and \"Not Never\" Revisited: On Branching Versus Linear Time, 14th Annual ACM Symp. on Theory of Computing, 1982.","DOI":"10.1145\/567067.567081"},{"key":"2_CR10","unstructured":"Emerson, E. A., and Lei, C. L., Temporal Model Checking Under Generalized Fairness Constraints, to be presented at the 18th Annual Hawaii International Conference on System Sciences."},{"key":"2_CR11","unstructured":"Emerson, E. A., and Lei, C. L., Modalities for Model Checking: Branching Time Strikes Back, to be presented at the 12th Annual ACM Symposium on Principles of Programming Languages."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Emerson, E. A., and Sistla, A. P., Deciding Branching Time Logic, 16 Annual ACM Symp. on Theory of Computing, 1984.","DOI":"10.1145\/800057.808661"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Francez, N., and Kozen, D., Generalized Fair Termination, 11th Annual ACM Symp. on Principles of Programming Languages, 1984, pp. 46\u201353.","DOI":"10.1145\/800017.800515"},{"key":"2_CR14","first-page":"194","volume":"18","author":"M. J. Fischer","year":"1979","unstructured":"Fischer, M. J., and Ladner, R. E., Propositional Dynamic Logic of Regular Programs, JCSS vol. 18, pp194\u2013211, 1979.","journal-title":"JCSS"},{"key":"2_CR15","volume-title":"Proc. International Symp. on Algorithmic Languages","author":"O. Grimberg","year":"1981","unstructured":"Grimberg, O., Francez, N., Makowsky, J. A., and deRoever, W. P., A proof rule for fair termination of guarded commands, Proc. International Symp. on Algorithmic Languages (North-Holland, Amsterdam, 1981)."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Kozen, D., Results on the Propositional Mu-calculus, Theoretical Computer Science, pp. 333\u2013354, December 83.","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Lamport, L., Sometimes is Sometimes \"Not Never\" \u2014 on the temporal logic of programs, 7th Annual ACM Symp. on Principles of Programming Languages, 1980, pp. 174\u2013185.","DOI":"10.1145\/567446.567463"},{"key":"2_CR18","first-page":"264","volume":"115","author":"D. Lehmann","year":"1981","unstructured":"Lehmann. D., Pnueli, A., and Stavi, J., Impartiality, Justice and Fairness: The Ethics of Concurrent Termination, ICALP 1981, LNCS Vol. 115, pp 264\u2013277.","journal-title":"ICALP"},{"key":"2_CR19","unstructured":"Lichtenstein, O. and Pnueli, A., Checking that Finite State Concurrent Programs Satisfy their Linear Specification, unpublished manuscript, July 84, (to appear in POPL85.)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Manna, Z., and Pnueli, A., The modal logic of programs, Proc. 6th Int. Colloquium on Automata, Languages, and Programming, Springer-Verlag Lecture Notes in Computer Science #71, pp. 385\u2013410, 1979.","DOI":"10.1007\/3-540-09510-1_31"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Manna, Z., and Wolper, P., Synthesis of Communicating Processes from Temporal Logic Specifications, TOPLAS, Vol. 6, #1, pp. 68\u201393.","DOI":"10.1145\/357233.357237"},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S. S. Owicki","year":"1982","unstructured":"Owicki, S. S., and Lamport, L., Proving Liveness Properties of Concurrent Programs, ACM Trans. on Programming Languages and Syst., Vol. 4, No. 3, July 1982, pp. 455\u2013495.","journal-title":"ACM Trans. on Programming Languages and Syst."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Parikh, R., A Decidability Result for a Second Order Process Logic, 17th Annual Symp. on Foundations of Computer Science, 1978.","DOI":"10.1109\/SFCS.1978.2"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Pnueli, A., The Temporal Logic of Programs, 19th annual Symp. on Foundations of Computer Science, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Pnueli, A., On The Extremely Fair Termination of Probabilistic Algorithms, 15 Annual ACM Symp. on Theory of Computing, 1983, 278\u2013290.","DOI":"10.1145\/800061.808757"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Pratt, V., Process Logic, 6th Annual ACM Symposium on Programming Languages, 1979.","DOI":"10.1145\/567752.567761"},{"key":"2_CR27","series-title":"Research Report","volume-title":"Fairness and Related Properties in Transition Systems","author":"J. P. Queille","year":"1982","unstructured":"Queille, J. P., and Sifaki, J., Fairness and Related Properties in Transition Systems, Research Report #292, IMAG, Grenoble, 1982."},{"key":"2_CR28","first-page":"1","volume-title":"Mathematical Logic and Foundations of Set Theory","author":"M. O. Rabin","year":"1968","unstructured":"Rabin, M. O., Weakly Definable Relations and Special Automata, in Mathematical Logic and Foundations of Set Theory, Y. Bar-Hillel, editor, North-Holland, Amsterdam, 1968, pp. 1\u201323."},{"key":"2_CR29","unstructured":"Vardi, M. and Wolper, P., Automata Theoretic Techniques for Modal Logics of Programs, pp. 446\u2013455, STOC84."}],"container-title":["STACS 86","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16078-7_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:12:47Z","timestamp":1578535967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16078-7_62"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540160786","9783540397588"],"references-count":29,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-16078-7_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1985]]},"assertion":[{"value":"5 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}