{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:48:27Z","timestamp":1729662507651,"version":"3.28.0"},"reference-count":39,"publisher":"IEEE Comput. Soc. Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.1990.113774","type":"proceedings-article","created":{"date-parts":[[2002,12,4]],"date-time":"2002-12-04T17:06:04Z","timestamp":1039021564000},"page":"4640-4675","source":"Crossref","is-referenced-by-count":1,"title":["On the limits of efficient temporal decidability"],"prefix":"10.1109","author":[{"given":"E.A.","family":"Emerson","sequence":"first","affiliation":[]},{"given":"M.","family":"Evangelist","sequence":"additional","affiliation":[]},{"given":"J.","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref5b","doi-asserted-by":"publisher","DOI":"10.1145\/5397.5399"},{"key":"ref3b","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90018-6"},{"key":"ref3a","first-page":"249","article-title":"Finite Models for Deterministic Propositional Dynamic Logic","author":"ben-ari","year":"1981","journal-title":"Proc 8th Annual International Colloquium on Automata Languages and Programming"},{"key":"ref25b","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)91258-X"},{"key":"ref29a","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.44"},{"key":"ref25a","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802492"},{"key":"ref13a","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80047-9"},{"journal-title":"Proc of the 16th Annual ACM Symp on Theory of Computing","first-page":"14","year":"1984","key":"ref13b"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.51"},{"key":"ref29b","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80051-5"},{"key":"ref4b","doi-asserted-by":"publisher","DOI":"10.1007\/BF01257083"},{"key":"ref4a","doi-asserted-by":"publisher","DOI":"10.1145\/567532.567551"},{"key":"ref10a","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802190"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21949"},{"key":"ref12","first-page":"21","article-title":"Temporal Reasoning under Generalized Fairness Constraints","author":"emerson","year":"1986","journal-title":"3rd Annual Symp on Theoretical Aspects of Computer Science"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75292"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/567446.567462"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1988.5270"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","article-title":"The Glory of The Past","author":"lichtenstein","year":"1985","journal-title":"Proc Conf on Logics of Programs"},{"key":"ref19","article-title":"Verification of Concurrent Programs: A Temporal Proof System","author":"manna","year":"1982","journal-title":"Proc 4th School on Advanced Programming"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22173"},{"key":"ref28a","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808711"},{"journal-title":"Parallel Program Design A Foundation","year":"1988","author":"chandy","key":"ref6"},{"key":"ref28b","first-page":"183","volume":"32","year":"1984","journal-title":"Journal of Computer and System Sciences"},{"key":"ref26a","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802189"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-15648-8_7","article-title":"Automata, Tableaux, and Temporal Logics","author":"emerson","year":"1985","journal-title":"Proc Conf on Logics of Programs"},{"key":"ref26b","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12159"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90098-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(83)90017-5"},{"journal-title":"Decidability and Expressiveness of Logics of Processes","year":"1980","author":"abrahamson","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(84)90003-0"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357178"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/357233.357237"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75293"},{"key":"ref10b","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90001-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"ref5a","doi-asserted-by":"publisher","DOI":"10.1145\/567067.567080"}],"event":{"name":"Fifth Annual IEEE Symposium on Logic in Computer Science","location":"Philadelphia, PA, USA"},"container-title":["[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx2\/305\/3367\/00113774.pdf?arnumber=113774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T11:37:14Z","timestamp":1497526634000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/113774\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/lics.1990.113774","relation":{},"subject":[]}}