{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:59Z","timestamp":1761611219273},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1109\/time.2007.63","type":"proceedings-article","created":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T20:26:09Z","timestamp":1201638369000},"page":"94-104","source":"Crossref","is-referenced-by-count":5,"title":["The Effects of Bounding Syntactic Resources on Presburger LTL"],"prefix":"10.1109","author":[{"given":"Stephane","family":"Demri","sequence":"first","affiliation":[]},{"given":"Regis","family":"Gascon","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2894"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30195-0_23"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1092"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73582"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80051-5"},{"key":"ref10","first-page":"262","article-title":"Flatness is not a weakness","author":"comon","year":"2000","journal-title":"CSL'00"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00485-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.09.006"},{"key":"ref13","first-page":"518","article-title":"Verification of qualitative Z-constraints","author":"demri","year":"2005","journal-title":"CONCUR'05"},{"key":"ref14","article-title":"The effects of bounding syntactic resources on Presburger LTL","author":"demri","year":"2006","journal-title":"Technical Report LSV-06–5 LSV"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3094"},{"key":"ref16","first-page":"145","article-title":"How to compose Presburger accelerations: Applications to broadcast protocols","author":"finkel","year":"2002","journal-title":"FST&TCS'02"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46541-3_29"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44612-5_38"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11690634_23"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(03)58003-2","article-title":"Bounded model checking","author":"biere","year":"2003"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.33"},{"key":"ref3","article-title":"From pointer systems to counter systems using shape analysis","author":"bardin","year":"2006","journal-title":"AVI '06"},{"key":"ref6","first-page":"517","article-title":"Programs with lists are counter automata","author":"bouajjani","year":"2006","journal-title":"CAV'06"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"},{"journal-title":"Symbolic methods for exploring infinite state spaces","year":"1998","author":"boigelot","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63141-0_10"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1995.523250"},{"key":"ref2","first-page":"162","article-title":"Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning","author":"balbiani","year":"2002","journal-title":"FROCOS '02"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017096"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174651"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/333979.333987"},{"key":"ref22","first-page":"387","article-title":"Model checking timed automata with one or two clocks","author":"laroussinie","year":"2004","journal-title":"CONCUR '04"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_23"},{"key":"ref24","first-page":"489","article-title":"Flat counter systems are every-where!","author":"leroux","year":"2005","journal-title":"A TVA '05"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31982-5_16"},{"journal-title":"Computation Finite and Infinite Machines","year":"1967","author":"minsky","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1024922.1024925"}],"event":{"name":"14th International Symposium on Temporal Representation and Reasoning (TIME'07)","start":{"date-parts":[[2007,6,28]]},"location":"Alicante, Spain","end":{"date-parts":[[2007,6,30]]}},"container-title":["14th International Symposium on Temporal Representation and Reasoning (TIME'07)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4438655\/4438656\/04438675.pdf?arnumber=4438675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T03:32:43Z","timestamp":1497756763000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4438675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/time.2007.63","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}