An algorithmic framework for coverability in well-structured systems

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn , Issue , 2012, Pages 173-182

  Strazny, Tim ^a   Meyer, Roland ^b  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b University of Koblenz Landau   (Germany)

Author keywords

Algorithmic framework; Experiments; Implementation; Lossy channel systems; Model checking; Petri nets; Well structured systems

Indexed keywords

ALGORITHMIC FRAMEWORK; COVERABILITY; DECISION PROCEDURE; IMPLEMENTATION; LOSSY CHANNEL SYSTEMS; PARTIAL ORDER REDUCTIONS; SELECTION FUNCTION;

DATA STRUCTURES; EXPERIMENTS; MODEL CHECKING; OPTIMIZATION; PETRI NETS; SYSTEMS ANALYSIS;

ALGORITHMS;

EID: 84866893228     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2012.26     Document Type: Conference Paper

References (29)

1. A. Finkel, "A generalization of the procedure of Karp and Miller to well structured transition systems," in ICALP'87, ser. LNCS, Th. Ottmann, Ed. Springer, 1987, vol. 267, pp. 499-508.
2. P. A. Abdulla, K. Čerāns, B. Jonsson, and Y.-K. Tsay, "General decidability theorems for infinite-state systems," in LICS'96. IEEE Comp. Soc., 1996, pp. 313-323.
3. R. M. Karp and R. E. Miller, "Parallel program schemata," JCSS, vol. 3, no. 2, pp. 147-195, 1969.
4. G. Delzanno, J.-F. Raskin, and L. Van Begin, "Attacking symbolic state explosion," in CAV'01, ser. LNCS, G. Berry, H. Comon, and A. Finkel, Eds. Springer, 2001, vol. 2102, pp. 298-310.
5. P. A. Abdulla, B. Jonsson, M. Kindahl, and D. Peled, "A general approach to partial order reductions in symbolic verification," in CAV'98, ser. LNCS, A. Hu and M. Vardi, Eds. Springer, 1998, vol. 1427, pp. 379-390.
6. P. Ganty, C. Meuter, L. Van Begin, G. Kalyon, J.-F. Raskin, and G. Delzanno, "Symbolic data structure for sets of k-uples of integers," Univ. Libre de Bruxelles, Tech. Rep. 570, 2007.
7. Ph. Schnoebelen, "Verifying lossy channel systems has nonprimitive recursive complexity," Inform. Process. Lett., vol. 83, no. 5, pp. 251-261, 2002.
8. G. Geeraerts, J.-F. Raskin, and L. Van Begin, "Expand, enlarge, and check: New algorithms for the coverability problem of wsts," in FSTTCS'04, K. Lodaya and M. Mahajan, Eds. Springer, 2005, pp. 490-493.
9. -, "Expand, enlarge and check⋯ made efficient," in CAV'05, K. Etessami and S. K. Rajamani, Eds. Springer, 2005, pp. 394-407.
10. J. Bingham, "A new approach to upward-closed set backward reachability analysis," TCS, vol. 138, pp. 37-48, 2005.
11. G. Higman, "Ordering by divisibility in abstract algebras," Proc. London Math. Soc., pp. 326-336, 1952.
12. L. Bozzelli and P. Ganty, "Complexity analysis of the backward coverability algorithm for VASS," in RP'11, ser. LNCS, G. Delzanno and I. Potapov, Eds., vol. 6945. Springer, 2011, pp. 96-109.
13. C. Rackoff, "The covering and boundedness problems for vector addition systems," TCS, vol. 6, no. 2, pp. 223-231, 1978.
14. R. J. Lipton, "The reachability problem requires exponential space," Dep. of Comp. Sci., Yale Univ., Tech. Rep. 63, 1976.
15. G. Delzanno, J.-F. Raskin, and L. Van Begin, "Towards the automated verification of multithreaded java programs," in TACAS'02, ser. LNCS, J.-P. Katoen and P. Stevens, Eds. Springer, 2002, vol. 2280, pp. 105-117.
16. A. Kaiser, D. Kroening, and Th. Wahl, "Dynamic cutoff detection in parameterized concurrent programs," in CAV'10, ser. LNCS, T. Touili, B. Cook, and P. Jackson, Eds., vol. 6174. Springer, 2010, pp. 645-659.
17. C. Dufourd, A. Finkel, and Ph. Schnoebelen, "Reset nets between decidability and undecidability," in ICALP'98, ser. LNCS, K. G. Larsen, S. Skyum, and G. Winskel, Eds. Springer, 1998, vol. 1443, pp. 103-115.
18. R. Valk, "On the computational power of extended petri nets," in MFCS'78, ser. LNCS, J. Winkowski, Ed. Springer, 1978, vol. 64, pp. 526-535.
19. -, "Self-modifying nets, a natural extension of petri nets," in ICALP'78, ser. LNCS, G. Ausiello and C. Böhm, Eds. Springer, 1978, vol. 62, pp. 464-476.
20. Ph. Schnoebelen, "Revisiting ackermann-hardness for lossy counter machines and reset petri nets," in MFCS'10, ser. LNCS, P. Hlinený and A. Kucera, Eds. Springer, 2010, vol. 6281, pp. 616-628.
21. A. Finkel and Ph. Schnoebelen, "Well-structured transition systems everywhere!" TCS, vol. 256, pp. 63-92, 2001.
22. M. Silva, E. Teruel, and J. Colom, "Linear algebraic and linear programming techniques for the analysis of place/transition net systems," in Lectures on Petri Nets I: Basic Models, ser. LNCS, W. Reisig and G. Rozenberg, Eds. Springer, 1998, vol. 1491, pp. 309-373.
23. G. Ciardo, "Petri nets with marking-dependent arc cardinality: Properties and analysis," in ATPN'94, ser. LNCS, vol. 815. Springer, 1994, pp. 179-198.
24. P. A. Abdulla, A. Bouajjani, and B. Jonsson, "On-the-fly analysis of systems with unbounded, lossy fifo channels," in CAV'98, ser. LNCS, A. Hu and M. Vardi, Eds. Springer, 1998, vol. 1427, pp. 305-318.
25. P. A. Abdulla, M. Kindahl, and D. Peled, "An improved search strategy for Lossy Channel Systems," in FORTE X/PSTV XVII '97, T. Mizuno, N. Shiratori, T. Hegashino, and A. Togashi, Eds. Chapman and Hall, 1997, pp. 251-264.
26. P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE T. Syst. Sci. Cyb., vol. 4, no. 2, pp. 100-107, Feb. 1968.
27. G. Ciardo and A. S. Miner, "Storage alternatives for large structured state spaces," in TOOLS'97, ser. LNCS, R. A. Marie, B. Plateau, M. Calzarossa, and G. Rubino, Eds., vol. 1245. Springer, 1997, pp. 44-57.
28. L. Van Begin, "Efficient verification of counting abstractions for parametric systems," Ph.D. dissertation, Univ. Libre de Bruxelles, Fac. des Sciences, Dép. d'Informatique, 2004.
29. R. Meyer, V. Khomenko, and T. Strazny, "A practical approach to verification of mobile systems using net unfoldings," Fund. Inform., vol. 94, no. 3-4, pp. 439-471, 2009.