{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:46:16Z","timestamp":1794343576339,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540482819","type":"print"},{"value":"9783540482826","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11916277_14","type":"book-chapter","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T14:32:59Z","timestamp":1161095579000},"page":"197-211","source":"Crossref","is-referenced-by-count":10,"title":["Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints"],"prefix":"10.1007","author":[{"given":"Laura","family":"Bozzelli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00e9gis","family":"Gascon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","first-page":"313","volume-title":"LICS 1996","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313\u2013321. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"14_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. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"ICALP 2004","author":"P.A. Abdulla","year":"1994","unstructured":"Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. In: ICALP 1994. LNCS, vol.\u00a0820. Springer, Heidelberg (1994)"},{"issue":"3","key":"14_CR4","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 TODS\u00a023(3), 231\u2013285 (1998)","journal-title":"ACM TODS"},{"key":"14_CR5","unstructured":"Bardzin, J., Bicevskis, J., Kalninsh, A.: Automatic construction of complete sample systems for program testing. In: IFIP Congress, pp. 57\u201362 (1977)"},{"key":"14_CR6","first-page":"123","volume-title":"LICS 1995","author":"A. Bouajjani","year":"1995","unstructured":"Bouajjani, A., Echahed, R., Habermehl, P.: On the verification problem of nonregular properties for nonregular processes. In: LICS 1995, pp. 123\u2013133. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-45069-6_12","volume-title":"Computer Aided Verification","author":"S. Bardin","year":"2003","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Fast Acceleration of Symbolic Transition Systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 118\u2013121. Springer, Heidelberg (2003)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Bozzelli, L., Gascon, R.: Branching-time temporal logic extended with Presburger constraints. Technical Report LSV-06-10, LSV (May 2006)","DOI":"10.1007\/11916277_14"},{"key":"14_CR9","unstructured":"Boigelot, B.: Symbolic methods for exploring infinite state spaces. PhD thesis, Universit\u00e9 de Li\u00e8ge (1998)"},{"key":"14_CR10","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":"14_CR11","unstructured":"\u010cer\u0101ns, K.: Deciding properties of integral relational automata. Technical Report No.\u00a073, Dept.\u00a0of Computer Sciences, Chalmers University of Technology, G\u00f6teborg, Sweden (1993). An extended abstract appeared in Proc. of ICALP 2004, LNCS 820 (1993)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"Computer Aided Verification","author":"H. Comon","year":"1998","unstructured":"Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and Presburger arithmetic. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 268\u2013279. Springer, Heidelberg (1998)"},{"key":"#cr-split#-14_CR13.1","unstructured":"Demri, S., D'Souza, D.: An automata-theoretic approach to constraint LTL. Technical Report LSV-03-11(2003)"},{"key":"#cr-split#-14_CR13.2","unstructured":"An extended abstract appeared in Proc. of FSTTCS 2002 (2002)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/11539452_39","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"S. Demri","year":"2005","unstructured":"Demri, S., Gascon, R.: Verification of qualitative \n                  \n                    \n                  \n                  $\\mathbb{\\MakeUppercase{z}}$\n                -constraints. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 518\u2013532. Springer, Heidelberg (2005)"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: Sometimes and not never revisited: On branching versus linear time. Journal of ACM\u00a033(1), 151\u2013178 (1986)","journal-title":"Journal of ACM"},{"issue":"1-2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. Ibarra","year":"1978","unstructured":"Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. Journal of ACM\u00a025(1), 116\u2013133 (1978)","journal-title":"Journal of ACM"},{"key":"14_CR18","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":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-28644-8_26","volume-title":"CONCUR 2004 - Concurrency Theory","author":"J. Leroux","year":"2004","unstructured":"Leroux, J., Sutre, G.: On flatness for 2-dimensional vector addition systems with states. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 402\u2013416. Springer, Heidelberg (2004)"},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/1024922.1024925","volume":"5","author":"C. Lutz","year":"2004","unstructured":"Lutz, C.: NEXPTIME-complete description logics with concrete domains. ACM Transactions on Computational Logic\u00a05(4), 669\u2013705 (2004)","journal-title":"ACM Transactions on Computational Logic"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(00)00101-8","volume":"256","author":"R. Mayr","year":"2001","unstructured":"Mayr, R.: Decidability of model checking with the temporal logic EF. Theoretical Computer Science\u00a0256, 31\u201362 (2001)","journal-title":"Theoretical Computer Science"},{"key":"14_CR22","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-31987-0_5","volume-title":"Programming Languages and Systems","author":"M. M\u00fcller-Olm","year":"2005","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Analysis of modular arithmetic. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 46\u201360. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11916277_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:05:13Z","timestamp":1558271113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11916277_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540482819","9783540482826"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11916277_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11916277","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}