{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:37:38Z","timestamp":1743093458375,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029585"},{"type":"electronic","value":"9783642029592"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02959-2_34","type":"book-chapter","created":{"date-parts":[[2009,7,25]],"date-time":"2009-07-25T05:02:22Z","timestamp":1248498142000},"page":"469-484","source":"Crossref","is-referenced-by-count":12,"title":["A Generalization of Semenov\u2019s Theorem to Automata over Real Numbers"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Boigelot","sequence":"first","affiliation":[]},{"given":"Julien","family":"Brusten","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes Rendus du Premier Congr\u00e8s des Math\u00e9maticiens des Pays Slaves, Warsaw, pp. 92\u2013101 (1929)"},{"key":"34_CR2","first-page":"1","volume-title":"Proc. International Congress on Logic, Methodoloy and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. International Congress on Logic, Methodoloy and Philosophy of Science, pp. 1\u201312. Stanford University Press, Stanford (1962)"},{"issue":"2","key":"34_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V. Bruy\u00e8re","year":"1994","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and p-recognizable sets of integers. Bulletin of the Belgian Mathematical Society\u00a01(2), 191\u2013238 (1994)","journal-title":"Bulletin of the Belgian Mathematical Society"},{"key":"34_CR4","unstructured":"Boigelot, B.: Symbolic methods for exploring infinite state spaces. PhD thesis, Universit\u00e9 de Li\u00e8ge (1998)"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"Cobham, A.: On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory\u00a03, 186\u2013192 (1969)","journal-title":"Mathematical Systems Theory"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00967164","volume":"18","author":"A. Semenov","year":"1977","unstructured":"Semenov, A.: Presburgerness of predicates regular in two number systems. Siberian Mathematical Journal\u00a018, 289\u2013299 (1977)","journal-title":"Siberian Mathematical Journal"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-63166-6_18","volume-title":"Computer Aided Verification","author":"B. Boigelot","year":"1997","unstructured":"Boigelot, B., Bronne, L., Rassart, S.: An improved reachability analysis method for strongly linear hybrid systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 167\u2013177. Springer, Heidelberg (1997)"},{"key":"34_CR8","unstructured":"The Li\u00e8ge Automata-based Symbolic Handler (LASH), http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash\/"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-73368-3_36","volume-title":"Computer Aided Verification","author":"B. Becker","year":"2007","unstructured":"Becker, B., Dax, C., Eisinger, J., Klaedtke, F.: LIRA: Handling constraints of linear arithmetics over the integers and the reals. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 307\u2013310. Springer, Heidelberg (2007)"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-70583-3_10","volume-title":"Automata, Languages and Programming","author":"B. Boigelot","year":"2008","unstructured":"Boigelot, B., Brusten, J., Bruy\u00e8re, V.: On the sets of real numbers recognized by finite automata in multiple bases. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 112\u2013123. Springer, Heidelberg (2008)"},{"issue":"3","key":"34_CR11","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/1071596.1071601","volume":"6","author":"B. Boigelot","year":"2005","unstructured":"Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Transactions on Computational Logic\u00a06(3), 614\u2013633 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"key":"34_CR12","unstructured":"van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B. Elsevier and MIT Press (1990)"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-540-70918-3_2","volume-title":"STACS 2007","author":"M. Vardi","year":"2007","unstructured":"Vardi, M.: The B\u00fcchi complementation saga. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 12\u201322. Springer, Heidelberg (2007)"},{"issue":"3","key":"34_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0190(00)00183-6","volume":"79","author":"C. L\u00f6ding","year":"2001","unstructured":"L\u00f6ding, C.: Efficient minimization of deterministic weak \u03c9-automata. Information Processing Letters\u00a079(3), 105\u2013109 (2001)","journal-title":"Information Processing Letters"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0055049","volume-title":"Automata, Languages and Programming","author":"B. Boigelot","year":"1998","unstructured":"Boigelot, B., Rassart, S., Wolper, P.: On the expressiveness of real and integer arithmetic automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 152\u2013163. Springer, Heidelberg (1998)"},{"key":"34_CR16","series-title":"Pure and Applied Mathematics","volume-title":"Infinite words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.: Infinite words. Pure and Applied Mathematics, vol.\u00a0141. Elsevier, Amsterdam (2004)"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Boigelot, B., Brusten, J.: A generalization of Cobham\u2019s theorem to automata over real numbers. Theoretical Computer Science (2009) (in press)","DOI":"10.1007\/978-3-642-02959-2_34"},{"key":"34_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0062837","volume-title":"The Computational Complexity of Logical Theories","author":"J. Ferrante","year":"1979","unstructured":"Ferrante, J., Rackoff, C.: The Computational Complexity of Logical Theories. Lecture Notes in Mathematics, vol.\u00a0718. Springer, Heidelberg (1979)"},{"key":"34_CR19","volume-title":"An introduction to the theory of numbers","author":"G.H. Hardy","year":"1985","unstructured":"Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers, 5th edn. Oxford University Press, Oxford (1985)","edition":"5"},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/3-540-56503-5_60","volume-title":"STACS 93","author":"T. Wilke","year":"1993","unstructured":"Wilke, T.: Locally threshold testable languages of infinite words. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol.\u00a0665, pp. 607\u2013616. Springer, Heidelberg (1993)"},{"issue":"3","key":"34_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R. Bryant","year":"1992","unstructured":"Bryant, R.: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"key":"34_CR22","first-page":"129","volume-title":"Proc. ACM SIGSAM ISSAC","author":"V. Weispfenning","year":"1999","unstructured":"Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: Proc. ACM SIGSAM ISSAC, Vancouver, pp. 129\u2013136. ACM Press, New York (1999)"},{"key":"34_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11817963_10","volume-title":"Computer Aided Verification","author":"J. Eisinger","year":"2006","unstructured":"Eisinger, J., Klaedtke, F.: Don\u2019t care words with an application to the automata-based approach for real addition. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 67\u201380. Springer, Heidelberg (2006)"},{"key":"34_CR24","unstructured":"Latour, L.: Presburger arithmetic: from automata to formulas. PhD thesis, Universit\u00e9 de Li\u00e8ge (2005)"},{"key":"34_CR25","first-page":"147","volume-title":"Proc. 20th LICS","author":"J. Leroux","year":"2005","unstructured":"Leroux, J.: A polynomial time Presburger criterion and synthesis for number decision diagrams. In: Proc. 20th LICS, Chicago, pp. 147\u2013156. IEEE Computer Society, Los Alamitos (2005)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-22"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02959-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T00:03:07Z","timestamp":1590019387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02959-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029585","9783642029592"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02959-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}