{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:57:33Z","timestamp":1776333453326,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212997","type":"print"},{"value":"9783540247302","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-24730-2_42","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:00:15Z","timestamp":1280761215000},"page":"576-590","source":"Crossref","is-referenced-by-count":20,"title":["FASTer Acceleration of Counter Automata in Practice"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Bardin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/10722167_32","volume-title":"Computer Aided Verification","author":"A. Annichini","year":"2000","unstructured":"Annichini, A., Asarin, E., Bouajjani, A.: Symbolic techniques for parametric reasoning about counter and clock systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 419\u2013434. Springer, Heidelberg (2000)"},{"key":"42_CR2","unstructured":"alv homepage, \n                    \n                      http:\/\/www.cs.ucsb.edu\/~bultan\/composite\/"},{"key":"42_CR3","unstructured":"Bartzis, C., Bultan, T.: Efficient symbolic representations for arithmetic constraints in verification. Technical Report ucsb cs:TR-2002-16, University of California, Santa Barbara, Computer Science (2002)"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-45069-6_26","volume-title":"Computer Aided Verification","author":"C. Bartzis","year":"2003","unstructured":"Bartzis, C., Bultan, T.: Efficient image computation in infinite state model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 249\u2013261. Springer, Heidelberg (2003)"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-61064-2_27","volume-title":"Trees in Algebra and Programming - CAAP \u201996","author":"A. Boudet","year":"1996","unstructured":"Boudet, A., Comon, H.: Diophantine equations, Presburger arithmetic and finite automata. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol.\u00a01059, pp. 30\u201343. Springer, Heidelberg (1996)"},{"key":"42_CR6","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":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-45739-9_19","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"A. Bouajjani","year":"2002","unstructured":"Bouajjani, A., Merceron, A.: Parametric verification of a group membership algorithm. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol.\u00a02469, pp. 311\u2013330. Springer, Heidelberg (2002)"},{"key":"42_CR8","unstructured":"Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Universit\u00e9 de Li\u00e8ge (1998)"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Boigelot, B., Wolper, P.: Symbolic verification with periodic sets, vol.\u00a02725, pp. 55\u201367 (1994)","DOI":"10.1007\/3-540-58179-0_43"},{"key":"42_CR10","unstructured":"Delzanno, G.: Home Page \u2013 Giorgio Delzanno, \n                    \n                      http:\/\/www.disi.unige.it\/person\/DelzannoG\/"},{"key":"42_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"key":"42_CR12","first-page":"352","volume-title":"Proc. 14th IEEE Symp. Logic in Computer Science (LICS 1999)","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: Proc. 14th IEEE Symp. Logic in Computer Science (LICS 1999), Trento, Italy, July 1999, pp. 352\u2013359. IEEE Comp. Soc. Press, Los Alamitos (1999)"},{"key":"42_CR13","unstructured":"Fast homepage, \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/fast\/"},{"key":"42_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36206-1_14","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"A. Finkel","year":"2002","unstructured":"Finkel, A., Leroux, J.: How to compose Presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 145\u2013156. Springer, Heidelberg (2002)"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Kopetz, H., Gr\u00fcnsteidl, G.: A time trigerred protocol for fault-tolerant real-time systems. In: IEEE computer, Volume January, pp. 14\u201323 (1994)","DOI":"10.1109\/2.248873"},{"key":"42_CR16","unstructured":"lash homepage, \n                    \n                      http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash\/"},{"key":"42_CR17","unstructured":"Leroux, J.: Algorithmique de la v\u00e9rification des syst\u00e8mes \u00e0 compteurs. Approximation et acc\u00e9l\u00e9ration. Impl\u00e9mentation de l\u2019outil Fast. PhD thesis, \u00c9cole Normale Sup\u00e9rieure de Cachan (December 12, 2003)"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Leroux, J.: The affine hull of a binary automaton is computable in polynomial time (2003)","DOI":"10.1016\/j.entcs.2003.10.007"},{"key":"42_CR19","unstructured":"The MONA project, \n                    \n                      http:\/\/www.brics.dk\/mona\/"},{"key":"42_CR20","unstructured":"TReX homepage, \n                    \n                      http:\/\/www.liafa.jussieu.fr\/~sighirea\/trex\/"},{"key":"42_CR21","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)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24730-2_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:53:30Z","timestamp":1558299210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24730-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212997","9783540247302"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24730-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}