{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:36:48Z","timestamp":1725665808095},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_2","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"3-20","source":"Crossref","is-referenced-by-count":1,"title":["Automata-Based Symbolic Representations of Polyhedra"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Boigelot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Brusten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Degbomont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-50335-8_28","volume-title":"Computational Geometry and its Applications","author":"H. Bieri","year":"1988","unstructured":"Bieri, H., Nef, W.: Elementary Set Operations with d-Dimensional Polyhedra. In: Noltemeier, H. (ed.) CG-WS 1988. LNCS, vol.\u00a0333, pp. 97\u2013112. Springer, Heidelberg (1988)"},{"key":"2_CR2","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":"2_CR3","doi-asserted-by":"crossref","unstructured":"Boigelot, B., Brusten, J., Degbomont, J.-F.: Implicit real vector automata. In: Proc. INFINITY. Electronic Proceedings in Theoretical Computer Science, vol.\u00a039, pp. 63\u201376 (2010)","DOI":"10.4204\/EPTCS.39.5"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-642-02959-2_34","volume-title":"Automated Deduction \u2013 CADE-22","author":"B. Boigelot","year":"2009","unstructured":"Boigelot, B., Brusten, J., Leroux, J.: A Generalization of Semenov\u2019s Theorem to Automata Over Real Numbers. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol.\u00a05663, pp. 469\u2013484. Springer, Heidelberg (2009)"},{"issue":"3","key":"2_CR5","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":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-48983-5_8","volume-title":"Hybrid Systems: Computation and Control","author":"O. Bournez","year":"1999","unstructured":"Bournez, O., Maler, O., Pnueli, A.: Orthogonal Polyhedra: Representation and Computation. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol.\u00a01569, pp. 46\u201360. Springer, Heidelberg (1999)"},{"key":"2_CR7","unstructured":"Brusten, J.: On the sets of real vectors recognized by finite automata in multiple bases. Ph.D. thesis, University of Li\u00e8ge (2011)"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11817963_11","volume-title":"Computer Aided Verification","author":"B. Dutertre","year":"2006","unstructured":"Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 81\u201394. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.comgeo.2006.11.009","volume":"38","author":"P. Hachenberger","year":"2007","unstructured":"Hachenberger, P., Kettner, L., Mehlhorn, K.: Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Comput. Geom.\u00a038(1-2), 64\u201399 (2007)","journal-title":"Comput. Geom."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-58485-4_43","volume-title":"Static Analysis","author":"N. Halbwachs","year":"1994","unstructured":"Halbwachs, N., Raymond, P., Proy, Y.E.: Verification of Linear Hybrid Systems by Means of Convex Approximations. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 223\u2013237. Springer, Heidelberg (1994)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.: An n logn algorithm for minimizing states in a finite automaton. Tech. rep., Stanford (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"2_CR13","unstructured":"Le Verge, H.: A note on Chernikova\u2019s algorithm. Tech. rep., IRISA, Rennes (1992)"},{"issue":"3","key":"2_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"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1145\/356827.356833","volume":"12","author":"A.A.G. Requicha","year":"1980","unstructured":"Requicha, A.A.G.: Representations for rigid solids: Theory, methods, and systems. ACM Comput. Surv.\u00a012(4), 437\u2013464 (1980)","journal-title":"ACM Comput. Surv."},{"key":"2_CR16","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of constraint programming. Elsevier (2006)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:27:12Z","timestamp":1556440032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}