{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:23Z","timestamp":1725663443529},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562870"},{"type":"electronic","value":"9783540475071"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56287-7_94","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:02:44Z","timestamp":1330254164000},"page":"51-67","source":"Crossref","is-referenced-by-count":4,"title":["An automata-theoretic decision procedure for Future Interval Logic"],"prefix":"10.1007","author":[{"given":"Y. S.","family":"Ramakrishna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. K.","family":"Dillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. E.","family":"Moser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. M.","family":"Melliar-Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Kutty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Aaby A A, Narayana K T, Propositional Temporal Interval Logic is PSPACE-Complete, Proc. 9th CADE, 1988, pp 218\u2013237.","DOI":"10.1007\/BFb0012834"},{"key":"3_CR2","unstructured":"Alur R, Techniques for Automatic Verification of Real-Time Systems, PhD Dissertation, Dept of Computer Science, Stanford University, August 1991."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Barringer H, Kuiper R, Pnueli A, Now You May Compose Temporal Logic Specifications, Proc. 16th ACM STOC, Washington DC, April 1984, pp 51\u201363.","DOI":"10.1145\/800057.808665"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Barringer H, Kuiper R, Pnueli A, A Really Abstract Concurrent Model and Its Temporal Logic, Proc. 18th ACM POPL, St. Petersburg Beach, January 1986, pp 173\u2013183.","DOI":"10.1145\/512644.512660"},{"issue":"No1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0890-5401(89)90026-6","volume":"81","author":"M. C. Browne","year":"1989","unstructured":"Browne M C, Clarke E M, Gr\u00fcmberg O, Reasoning about Networks with Many Identical Finite State Processes, Information and Computation, Vol 81, No 1, April 1989, pp 13\u201331.","journal-title":"Information and Computation"},{"key":"3_CR6","unstructured":"B\u00fcchi J R, On a Decision Method in Restricted Second Order Arithmetic, Logic, Methodology and Philosophy of Science, Proc. 1960 Congress, Stanford University Press, Stanford, pp 1\u201311."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcchi J R, The Monadic Second Order Theory of All Countable Ordinals, in G H M\u00fcller and D Siefkes, Decidable Theories II, Lecture Notes in Mathematics, 328, Springer-Verlag, 1973, pp 1\u2013126.","DOI":"10.1007\/BFb0082721"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Clarke E M, Gr\u00fcmberg O, Avoiding the State Explosion Problem in Temporal Logic Model Checking Algorithms, Proc. 6th ACM PODC, Vancouver, August 1987, pp 294\u2013303.","DOI":"10.1145\/41840.41865"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Dillon L K, Kutty G, Moser L E, MelliarSmith P M, Ramakrishna Y S, Graphical Specifications for Concurrent Software Systems, Proc. 14th ICSE, Melbourne, May 1992, pp 214\u2013224.","DOI":"10.1145\/143062.143116"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M. J. Fischer","year":"1979","unstructured":"Fischer M J, Ladner R E, Propositional Dynamic Logic of Regular Programs, J. Computer and System Sciences, Vol 18, 1979, pp 194\u2013211.","journal-title":"J. Computer and System Sciences"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Griswold V J, Core Algorithms for Autonomous Monitoring of Distributed Systems, Proc. ACM\/ONR Workshop on Parallel and Distributed Debugging, May 1991, pp 23\u201334.","DOI":"10.1145\/122759.122762"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Halpern J, Manna Z, Moszkowski B, A Hardware Semantics Based on Temporal Intervals, Proc. 10th ICALP, Barcelona, 1983, pp 278\u2013291.","DOI":"10.1007\/BFb0036915"},{"issue":"No4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1145\/115234.115351","volume":"38","author":"J Halpern","year":"1991","unstructured":"Halpern J, Shoham Y, A Propositional Modal Logic of Time Intervals, J. ACM, Vol 38, No 4, October 1991, pp 935\u2013962.","journal-title":"J. ACM"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(85)90225-7","volume":"38","author":"D Harel","year":"1985","unstructured":"Harel D, Peleg D, Process Logic with Regular Formulas, Theoretical Computer Science, Vol 38, 1985, pp 307\u2013322.","journal-title":"Theoretical Computer Science"},{"key":"3_CR15","unstructured":"Kutty G, Ramakrishna Y S, Dillon L K, Moser L E, Melliar-Smith P M, Specification of a Communication Protocol in Graphical Interval Logic, Proc. IEE Conf. Information Engineering, Singapore, December 1991, pp 432\u2013441."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Lamport L, What Good is Temporal Logic, Proc. IFIP Congress, Paris, 1983, pp 657\u2013668.","DOI":"10.1145\/2402.322398"},{"issue":"No2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L Lamport","year":"1983","unstructured":"Lamport L, Specifying Concurrent Program Modules, ACM TOPLAS, Vol 5, No 2, 1983, pp 190\u2013222.","journal-title":"ACM TOPLAS"},{"key":"3_CR18","volume-title":"Tech Rep 79","author":"L Lamport","year":"1991","unstructured":"Lamport L, The Temporal Logic of Actions, Tech Rep 79, DEC Systems Research Center, Palo Alto, December 1991."},{"key":"3_CR19","first-page":"215","volume-title":"The Correctness Problem in Computer Science","author":"Z Manna","year":"1982","unstructured":"Manna Z, Pnueli A, Verification of Concurrent Programs: The Temporal Framework, In R S Boyer and J S Moore, editors, The Correctness Problem in Computer Science, Academic Press, London, 1982, pp 215\u2013273."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Narayana K T, Aaby A A, Specification of Real-Time Systems in Real-Time Interval Logic, Proc. IEEE RTSS, December 1988, pp 86\u201395.","DOI":"10.1109\/REAL.1988.51104"},{"issue":"No2","key":"3_CR21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M. H. A. Newman","year":"1942","unstructured":"Newman M H A, On Theories with a Combinatorial Definition of \u201cEquivalence\u201d, Annals of Mathematics, Vol 43, No 2, April 1942, pp 223\u2013243.","journal-title":"Annals of Mathematics"},{"key":"3_CR22","unstructured":"Plaisted D, A Low Level Language for Obtaining Decision Procedures for Classes of Temporal Logics, in Schwartz et al, An Interval Logic for Higher-Level Temporal Reasoning, NASA Contractor Report 172262, September 1983, pp 65\u201382."},{"key":"3_CR23","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"Rabin M O, Decidability of Second Order Theories and Automata on Infinite Trees, Trans. AMS, Vol 141, 1969, pp 1\u201335.","journal-title":"Trans. AMS"},{"key":"3_CR24","unstructured":"Ramakrishna Y S, Melliar-Smith P M, Moser L E, Dillon L K, Kutty G, Interval Logic is Non-Elementarily Decidable, unpublished manuscript, February 1992."},{"issue":"No3","key":"3_CR25","first-page":"10","volume":"114","author":"R. R. Razouk","year":"1989","unstructured":"Razouk R R, Gorlick M M, A Real-Time Interval Logic For Reasoning About Executions of Real-Time Programs, Proc. 3rd Symp. Software Testing, Analysis and Verification, Key West, SIGSOFT Software Engineering Notes, Vol 114, No 3, December 1989, pp 10\u201319.","journal-title":"Proc. 3rd Symp. Software Testing, Analysis and Verification, Key West, SIGSOFT Software Engineering Notes"},{"key":"3_CR26","unstructured":"Rosner R, Pnueli A, A Choppy Logic, Proc. IEEE LICS, July 1986, pp 306\u2013313."},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Savitch W J, Relationship between Non-Deterministic and Deterministic Tape Complexities, J. Computer and System Sciences, Vol 4, No 2, pp 177\u2013192.","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Schwartz R L, Melliar-Smith P M, Vogt F, An Interval Logic for Higher-Level Temporal Reasoning, Proc. ACM PODC, Montreal, Canada, August 1983, pp. 173\u2013186.","DOI":"10.1145\/800221.806720"},{"issue":"No2","key":"3_CR29","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M Vardi","year":"1986","unstructured":"Vardi M, Wolper P, Automata-Theoretic Techniques for Modal Logics of Programs, J. Computer and System Sciences, Vol 32, No 2, April 1986, pp 183\u2013210.","journal-title":"J. Computer and System Sciences"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Wolper P, On the Relation of Programs and Computations to Models of Temporal Logic, Proc. Conf. Temporal Logic in Specification, Altrincham, April 1987, LNCS 398, Springer-Verlag, pp 75\u2013123.","DOI":"10.1007\/3-540-51803-7_23"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56287-7_94.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:18Z","timestamp":1605646998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56287-7_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562870","9783540475071"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-56287-7_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}