Reversal-bounded counter machines revisited

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

Volumn 5162 LNCS, Issue , 2008, Pages 323-334

  Finkel, Alain ^a   Sangnier, Arnaud ^a,b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b EDF R AND D   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; FOUNDATIONS;

COUNTER MACHINES; FINITE NUMBERS; REACHABILITY SETS; VECTOR ADDITION SYSTEMS;

COMPUTER SCIENCE;

EID: 54249139172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85238-4_26     Document Type: Conference Paper

References (21)

1. Annichini, A., Bouajjani, A., Sighireanu, M.: TReX: A tool for reachability analysis of complex systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 368-372. Springer, Heidelberg (2001)
2. Araki, T., Kasami, T: Decidable problems on the strong connectivity of Petri net reachability sets. Theor. Comput. Sci. 4(1), 99-119 (1977)
3. Bardin, S., Leroux, J., Point, G.: FAST extended release. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 63-66. Springer, Heidelberg (2006)
4. Ibarra, O.H., Dang, Z., San Pietro, P.: Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. In: Hariharan, R., Mukund, M., Vinay. V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 132-143. Springer, Heidelberg (2001)
5. Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundam. Inform. 31(1), 13-25 (1997)
6. Finkel, A., Leroux, J.: How to compose Presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 145-156. Springer, Heidelberg (2002)
7. Finkel, A., Sangnier, A.: Reversal-bounded counter machines revisited. Research report, Laboratoire Specification et Verification, ENS Cachan (2008)
8. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc (3) 2, 326-336 (1952)
9. Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135-159 (1979)
10. Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM 25(1), 116-133 (1978)
11. Ibarra, O.H., Su, J., Dang, Z., Bultan, T., Kemmerer, R.A.: Counter machines and verification problems. Theor. Comput. Sci. 289(1), 165-189 (2002)
12. Jantzen, M.: Complexity of place/transition nets. In: APN 1986. LNCS, vol. 254, pp. 413-434. Springer, Heidelberg (1987)
13. Karp, R.M., Miller, R.E.: Parallel program schemata: A mathematical model for parallel computation. In: FOCS 1967, pp. 55-61. IEEE Computer Society Press, Los Alamitos (1967)
14. Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC 1982, pp. 267-281. ACM Press, New York (1982)
15. Landweber, L.H., Robertson, E.L.: Properties of conflict-free and persistent Petri nets. J. ACM 25(3), 352-364 (1978)
16. Homepage of LASH, http://www.montefiore.ulg.ac.be/-boigelot/research/lash
17. Leroux, J., Sutre, G.: Flat counter almost everywhere! In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 474-488. Springer, Heidelberg (2005)
18. Mayr, E.W.: Persistence of vector replacement systems is decidable. Acta Inf. 15, 309-318 (1981)
19. Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441-460 (1984)
20. Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Upper Saddle River, NJ, USA (1967)
21. Valk, R., Vidal-Naquet, G.: Petri nets and regular languages. J. Comput. Syst. Sci. 23(3), 299-325 (1981)