Flat counter automata almost everywhere!

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

Volumn 3707 LNCS, Issue , 2005, Pages 489-503

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

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; CODES (SYMBOLS); MATHEMATICAL MODELS; PETRI NETS; VECTORS;

REVERSAL BOUNDED COUNTER MACHINES; SEMI-ALGORITHMIC TECHNIQUE; SYMBOLIC PROCEDURES; VECTOR ADDITION SYSTEMS;

AUTOMATA THEORY;

EID: 33646167672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11562948_36     Document Type: Conference Paper

References (32)

1. [ABS01] 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. [AK77] T. Araki and T. Kasami. Decidable problems on the strong connectivity of Petri net reachability sets. Theoretical Computer Science, 4(1):99-119, 1977.
3. [BF97] Z. Bouziane and A. Finkel. Cyclic petri net reachability sets are semi-linear effectively constructible. In Proc. 2nd Int. Workshop on Verification of Infinite State Systems (INFINITY'97), Bologna, Italy, July 1997, volume 9 of Electronic Notes in Theor. Camp. Sci. Elsevier, 1997.
4. [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.
5. [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.
6. [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.
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. [Boi03] B. Boigelot. On iterating linear transformations over recognizable sets of integers. Theoretical Computer Science, 309(2):413-468, 2003.
9. [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.
10. [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.
11. [Dic13] L. E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with r distinct prime factors. Amer. Journal Math., 35:413-422, 1913.
12. [DJS99] C. Dufourd, P. Jančar, and Ph. Schnoebelen. Boundedness of Reset P/T nets. In Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP'99), Prague, Czech Republic, July 1999, volume 1644 of Lecture Notes in Computer Science, pages 301-310. Springer, 1999.
13. [Esp97] J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 31(1):13-25, 1997.
14. [FIS03] A. Finkel, S. P. Iyer, and G. Sutre. Well-abstracted transition systems: Application to FIFO automata. Information and Computation, 181(1):1-31, 2003.
15. [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.
16. [FO97] L. Fribourg and H. Olsén. A decompositional approach for computing least fixed-points of Datalog programs with Z-counters. Constraints, 2(3/4):305-335, 1997.
17. [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.
18. [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 (STACS'2000), Lille, France, Feb. 2000, volume 1770 of Lecture Notes in Computer Science, pages 346-357. Springer, 2000.
19. [GS66] S. Ginsburg and E. H. Spanier. Semigroups, Presburger formulas and languages. Pacific J. Math., 16(2):285-296, 1966.
20. [Hir94] Y. Hirshfeld. Congruences in commutative semigroups. Research report ECS-LFCS-94-291, Laboratory for Foundations of Computer Science, University of Edinburgh, UK, 1994.
21. [HP79] J. E. Hopcroft and J.-J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8(2):135-159, 1979.
22. [Iba78] O.H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116-133, 1978.
23. [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.
24. [Las] LASH homepage. http://www.montefiore.ulg.ac.be/~boigelot/research/ lash/.
25. [Lat04] L. Latour. From automata to formulas: Convex integer polyhedra. In Proc. 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), Turku, Finland July 2004, pages 120-129. IEEE Comp. Soc. Press, 2004.
26. [LR78] L.H. Landweber and E.L. Robertson. Properties of conflict-free and persistent petri nets. Journal of the ACM, 25(3):352-364, 1978.
27. [LS04] J. Leroux and G. Sutre. On flatness for 2-dimensional vector addition systems with states. In Proc. 15th Int. Conf. Concurrency Theory (CONCVR'04), London, UK, Aug.-Sep. 2004, volume 3170 of Lecture Notes in Computer Science, pages 402-416, Springer, 2004.
28. [May81] B.W. Mayr. Persistence of vector replacement systems is decidable. Acta Informatica, 15:309-318, 1981.
29. [May84] E. W. Mayr. An algorithm for the general Petri net reachability problem. SIAM J. Comput., 13(3):441-460, 1984.
30. [Min67] M. L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, London, 1 edition, 1967.
31. [Tai68] M.A. Taiclin. Algorithmic problems for commutative semigroups. Soviet Math. Doklady, 9(1):201-204, 1968.
32. [VVN81] R. Valk and G. Vidal-Naquet. Petri nets and regular languages. Journal of Computer and System Sciences, 23(3):299-325, 1981.