{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:50:17Z","timestamp":1725562217237},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_10","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"121-135","source":"Crossref","is-referenced-by-count":7,"title":["LTL over Integer Periodicity Constraints"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Demri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(89)90138-2","volume":"65","author":"M. Abadi","year":"1989","unstructured":"Abadi, M.: The power of temporal proofs. TCS\u00a065, 35\u201383 (1989)","journal-title":"TCS"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. TCS\u00a0126, 183\u2013235 (1994)","journal-title":"TCS"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R. Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.: A really temporal logic. JACM\u00a041(1), 181\u2013204 (1994)","journal-title":"JACM"},{"key":"10_CR4","unstructured":"Bertino, E., Bettini, C., Ferrari, E., Samarati, P.: Supporting periodic authorizations and temporal reasoning in database access control. In: 22nd VLDB, Bombay, India, pp. 472\u2013483 (1996)"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/293910.293151","volume":"23","author":"E. Bertino","year":"1998","unstructured":"Bertino, E., Bettini, C., Ferrari, E., Samarati, P.: An access control model supporting periodicity constraints and temporal reasoning. ACM Transactions on Databases Systems\u00a023(3), 231\u2013285 (1998)","journal-title":"ACM Transactions on Databases Systems"},{"key":"10_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45988-X_13","volume-title":"Frontiers of Combining Systems","author":"P. Balbiani","year":"2002","unstructured":"Balbiani, P., Condotta, J.-F.: Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In: Armando, A. (ed.) FroCos 2002. LNCS (LNAI), vol.\u00a02309, pp. 162\u2013173. Springer, Heidelberg (2002)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Echahed, R., Habermehl, P.: On the verification problem of nonregular properties for nonregular processes. In: LICS 1995, pp. 123\u2013133 (1995)","DOI":"10.1109\/LICS.1995.523250"},{"issue":"1\u20132","key":"10_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00033-X","volume":"221","author":"A. Bouajjani","year":"1999","unstructured":"Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of FIFOchannel systems with nonregular sets of configurations. TCS\u00a0221(1\u20132), 211\u2013250 (1999)","journal-title":"TCS"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44622-2_17","volume-title":"Computer Science Logic","author":"H. Comon","year":"2000","unstructured":"Comon, H., Cortier, V.: Flatness is not a weakness. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 262\u2013276. Springer, Heidelberg (2000)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"\u010cer\u0101ns, K.: Deciding properties of integral relational automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, Springer, Heidelberg (1994)","DOI":"10.1007\/3-540-58201-0_56"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/TIME.2002.1027486","volume-title":"Int. Symposium on Temporal Representation and Reasoning","author":"C. Combi","year":"2002","unstructured":"Combi, C., Franceschet, M., Peron, A.: A logical approach to represent and reason about calendars. In: Int. Symposium on Temporal Representation and Reasoning, pp. 134\u2013140. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Chandra, A., Merlin, P.: Optimal implementation of conjunctive queries in relational databases. In: STOC-9, pp. 77\u201390 (1977)","DOI":"10.1145\/800105.803397"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-36206-1_12","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"S. Demri","year":"2002","unstructured":"Demri, S., D\u2019Souza, D.: An automata-theoretic approach to constraint LTL. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 121\u2013132. Springer, Heidelberg (2002)"},{"key":"10_CR14","unstructured":"Demri, S., D\u2019Souza, D.: An automata-theoretic approach to constraint LTL. Technical Report LSV-03-11, LSV, 40 pages(August 2003) (submitted)"},{"key":"10_CR15","unstructured":"Demri, S.: LTL over Integer Periodicity Constraints. Technical Report LSV- 03-13, LSV, 34 pages (October 2003)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-36206-1_14","volume-title":"FST & TCS 2002","author":"A. Finkel","year":"2002","unstructured":"Finkel, A., Leroux, J.: How to compose Presburger accelerations: Applications to broadcast protocols. In: FST & TCS 2002. LNCS, vol.\u00a02256, pp. 145\u2013156. Springer, Heidelberg (2002)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Gabbay, D., Hodkinson, I., Reynolds, M.: Temporal Logic - Mathematical Foundations and Computational Aspects, Volume 1. OUP (1994)","DOI":"10.1093\/oso\/9780198537694.003.0001"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-45187-7_15","volume-title":"CONCUR 2003 - Concurrency Theory","author":"P. Gastin","year":"2003","unstructured":"Gastin, P., Kuske, D.: Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 222\u2013236. Springer, Heidelberg (2003)"},{"key":"10_CR19","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"G. Kreisel","year":"1967","unstructured":"Kreisel, G., Krivine, J.L.: Elements of Mathematical Logic. In: Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam (1967)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-47724-1_15","volume-title":"Advances in Spatial and Temporal Databases","author":"U. Lago Dal","year":"2001","unstructured":"Dal Lago, U., Montanari, A.: Calendars, time granularities, and automata. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, pp. 279\u2013298. Springer, Heidelberg (2001)"},{"key":"10_CR21","first-page":"383","volume-title":"LICS 2002","author":"F. Laroussinie","year":"2002","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: LICS 2002, pp. 383\u2013392. IEEE Computer Society, Los Alamitos (2002)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","first-page":"161","volume-title":"Information and Knowledge Management","author":"M. Niezette","year":"1993","unstructured":"Niezette, M., Stevenne, J.: An efficient symbolic representation of periodic time. In: Finin, T.W., Yesha, Y., Nicholas, C. (eds.) CIKM 1992. LNCS, vol.\u00a0752, pp. 161\u2013168. Springer, Heidelberg (1993)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Ohlbach, H.J.: Calendar logic. In: [GHR94] ch. 19 (1994)","DOI":"10.1002\/j.2048-7940.1994.tb01324.x"},{"key":"10_CR24","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. Comptes Rendus du premier congr\u00e8s de math\u00e9maticiens des Pays Slaves, Warszawa, pp. 92\u2013101 (1929)"},{"issue":"3","key":"10_CR25","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. Sistla","year":"1985","unstructured":"Sistla, A., Clarke, E.: The complexity of propositional linear temporal logic. JACM\u00a032(3), 733\u2013749 (1985)","journal-title":"JACM"},{"issue":"3","key":"10_CR26","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0743-1066(97)10008-5","volume":"35","author":"D. Toman","year":"1998","unstructured":"Toman, D., Chomicki, J.: DATALOG with integer periodicity constraints. Journal of Logic Programming\u00a035(3), 263\u2013290 (1998)","journal-title":"Journal of Logic Programming"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M. Vardi","year":"1994","unstructured":"Vardi, M., Wolper, P.: Reasoning about infinite computations. Information and Computation\u00a0115, 1\u201337 (1994)","journal-title":"Information and Computation"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46419-0_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P. Wolper","year":"2000","unstructured":"Wolper, P., Boigelot, B.: On the construction of automata from linear arithmetic constraints. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 1\u201319. Springer, Heidelberg (2000)"},{"key":"10_CR29","first-page":"9","volume-title":"AAAI Workshop on Spatial and Temporal Granularity","author":"J. Wijsen","year":"2000","unstructured":"Wijsen, J.: A string based-model for infinite granularities. In: AAAI Workshop on Spatial and Temporal Granularity, pp. 9\u201316. AAAI Press, Menlo Park (2000)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T23:24:25Z","timestamp":1711668265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}