On flatness for 2-Dimensional vector addition systems with states

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

Volumn 3170, Issue , 2004, Pages 402-416

  Leroux, Jérôme ^a   Sutre, Grégoire ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; VECTORS;

ACCELERATION TECHNIQUE; COUNTER AUTOMATA; NESTED LOOPS; NONNEGATIVE INTEGERS; REACHABILITY SET; SEMILINEAR; SYMBOLIC MODEL CHECKERS; VECTOR ADDITION SYSTEMS;

PETRI NETS;

EID: 35048835694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_26     Document Type: Article

References (20)

1. [ABS0l] A. Annichini, A. Bouajjani, and M. Sighireanu. TReX: A tool for reachability analysis of complex systems. In Proc. 13th Int. Conf. Computer Aided Verification (CAV'2001), Paris, France, July 2001, volume 2102 of Lecture Notes in Computer Science, pages 368-372. Springer, 2001.
2. [BFLP03] S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Fast Acceleration of Symbolic Transition systems. In Proc. 15th Int. Conf. Computer Aided Verification (CAV'2003), Boulder, CO, USA, July 2003, volume 2725 of Lecture Notes in Computer Science, pages 118-121. Springer, 2003.
3. [BGWW97] B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. Static Analysis 4th Int. Symp. (SAS'97), Paris, France, Sep. 1997, volume 1302 of Lecture Notes in Computer Science, pages 172-186. Springer, 1997.
4. [BH99] A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theoretical Computer Science, 221(1-2):211-250, 1999.
5. [BJNT00] A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In Proc. 12th Int. Conf. Computer Aided Verification (CAV'2000), Chicago, IL, USA, July 2000, volume 1855 of Lecture Notes in Computer Science, pages 403-418. Springer, 2000.
6. [BLW03] B. Boigelot, A. Legay, and P. Wolper. Iterating transducers in the large. In Proc. 15th Int. Conf. Computer Aided Verification (CAV'2003), Boulder, CO, USA, July 2003, volume 2725 of Lecture Notes in Computer Science, pages 223-235. Springer, 2003.
7. [BM99] A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Proc. 16th Ann. Symp. Theoretical Aspects of Computer Science (STACS'99), Trier, Germany, Mar. 1999, volume 1563 of Lecture Notes in Computer Science, pages 323-333. Springer, 1999.
8. [BW94] B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. 6th Int. Conf. Computer Aided Verification (CAV'94), Stanford, CA, USA, June 1994, volume 818 of Lecture Notes in Computer Science, pages 55-67. Springer, 1994.
9. [CJ98] H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In Proc. 10th Int. Conf. Computer Aided Verification (CAV'98), Vancouver, BC, Canada, June-July 1998, volume 1427 of Lecture Notes in Computer Science, pages 268-279. Springer, 1998.
10. [FIS03] A. Finkel, S. P. lyer, and G. Sutre. Well-abstracted transition systems: Application to FIFO automata. Information and Computation, 181(1):131, 2003.
11. [FL02] A. Finkel and J. Leroux. How to compose Presburger-accelerations: Applications to broadcast protocols. In Proc. 22nd Conf. Found, of Software Technology and Theor. Comp. Sci. (FST&TCS'2002), Kanpur, India, Dec. 2002, volume 2556 of Lecture Notes in Computer Science, pages 145-156. Springer, 2002.
12. [FS00a] A. Finkel and G. Sutre. An algorithm constructing the semilinear post*for 2-dim reset/transfer vass. In Proc. 25th Int. Symp. Math. Found. Comp. Sci. (MFCS'2000), Bratislava, Slovakia, Aug. 2000, volume 1893 of Lecture Notes in Computer Science, pages 353-362. Springer, 2000.
13. [FS00b] A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. In Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STAGS'8000), Lille, France, Feb. 2000, volume 1770 of Lecture Notes in Computer Science, pages 346-357. Springer, 2000.
14. [GS66] S. Ginsburg and E. H. Spanier. Semigroups, Presburger formulas and languages. Pacific J. Math., 16(2):285-296, 1966.
15. [HM00] T. A. Henzinger and R. Majumdar. A classification of symbolic transition systems. In Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS'2000), Lille, France, Feb. 2000, volume 1770 of Lecture Notes in Computer Science, pages 13-34. Springer, 2000.
16. [HP79] J. E. Hopcroft and J.-J. Pansiot. On the reachability problem for 5dimensional vector addition systems. Theoretical Computer Science, 8(2):135-159, 1979.
17. [Kos82] S. R. Kosaraju. Decidability of reachability in vector addition systems. In Proc. 14th ACM Symp. Theory of Computing (STOC'82), San Francisco, CA, May 1982, pages 267-281, 1982.
18. [Las] LASH homepage. http://www.montefiore.ulg.ac.be/~boigelot/ research/lash/.
19. [May84] E. W. Mayr. An algorithm for the general Petri net reachability problem. SIAM J. Comput, 13(3):441-460, 1984.
20. [Min67] M. L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, London, 1 edition, 1967.