Faster acceleration of counter automata in practice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2988, Issue , 2004, Pages 576-590

  Bardin, Sébastien ^a   Finkel, Alain ^a   Leroux, Jérôme ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ACCELERATION; AUTOMATA THEORY; COMPUTER PROGRAMMING;

ACCELERATION ALGORITHM; COUNTER AUTOMATA; GENERIC ALGORITHM; INDUSTRIAL PROTOCOLS; POLYHEDRAL DOMAINS; REACHABILITY SET; SYMBOLIC REPRESENTATION;

ALGORITHMS;

EID: 35048838114     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_42     Document Type: Article

References (20)

1. [AAB00] A. Annichini, E. Asarin, and A. Bouajjani. Symbolic techniques for parametric reasoning about counter and clock systems, volume 1855, pages 419-434, 2000.
2. [ALV] ALV homepage. http://www.cs.ucsb.edu/~bultan/composite/.
3. [BB03] C. Bartzis and T. Bultan. Efficient image computation in infinite state model checking, volume 2725, pages 249-261, 2003.
4. [BC96] A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In H. Kirchner, editor, Proc. Coll. on Trees in Algebra and Programming (CAAP'96), volume 1059, pages 30-43, 1996.
5. [BFLP03] S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Fast Acceleration of Symbolic Transition systems, volume 2725, pages 118-121, 2003.
6. [BM02] A. Bouajjani and A. Merceron. Parametric verification of a group membership algorithm, volume 2469, pages 311-330, 2002.
7. [Boi98] B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Université de Liège, 1998.
8. [BW94] B. Boigelot and P. Wolper. Symbolic verification with periodic sets, volume 2725, pages 55-67, 1994.
9. [Del] G. Delzanno. Home Page - Giorgio Delzanno. http://www.disi.unige. it/person/DelzannoG/.
10. [DFS98] C. Dufourd, A. Finkel, and P. Schnoebelen. Reset nets between decidability and undecidability. In Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP'98), Aalborg, Denmark, July 1998, volume 1443, pages 103-115, 1998.
11. [EFM99] J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proc. 14th IEEE Symp. Logic in Computer Science (LICS'99), Trento, Italy, July 1999, pages 352-359. IEEE Comp. Soc. Press, 1999.
12. [FAS] FAST homepage. http://www.lsv.ens-cachan.fr/fast/.
13. [FL02] A. Finkel and J. Leroux. How to compose Presburger-accelerations: Applications to broadcast protocols, volume 2556, pages 145-156, 2002.
14. [KG94] H. Kopetz and G. Grünsteidl. A time trigerred protocol for fault-tolerant real-time systems. In IEEE computer, volume January, pages 14-23, 1994.
15. [LAS] LASH homepage. http://www.monteflore.ulg.ac.be/~boigelot/research/ lash/.
16. th december 2003.
17. [Ler03b] J. Leroux. The affine hull of a binary automaton is computable in polynomial time. 2003.
18. [MON] The MONA project. http://www.brics.dk/mona/.
19. [TRE] TREX homepage. http://www.liafa.jussieu.fr/~sighirea/trex/.
20. [WB00] P. Wolper and B. Boigelot. On the construction of automata from linear arithmetic constraints, volume 1785, pages 1-19, 2000.