Parameterized verification of broadcast networks of register automata

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

Volumn 8169 LNCS, Issue , 2013, Pages 109-121

  Delzanno, Giorgio ^a   Sangnier, Arnaud ^b   Traverso, Riccardo ^a  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

BROADCAST NETWORKS; CONTROL STATE; INITIAL CONFIGURATION; PARAMETERIZED VERIFICATIONS; REACHABILITY; SAFETY PROPERTY;

AUTOMATA THEORY;

EID: 84886391938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-41036-9_11     Document Type: Conference Paper

References (25)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313-321. IEEE Computer Society (1996)
2. Abdulla, P.A., Delzanno, G., Van Begin, L.: A classification of the expressive power of well-structured transition systems. Inf. Comput. 209(3), 248-279 (2011)
3. Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Inf. Comput. 130(1), 71-90 (1996)
4. Abdulla, P.A., Jonsson, B.: Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256(1-2), 145-167 (2001)
5. Arons, T., Pnueli, A., Ruah, S., Xu, J., Zuck, L.D.: Parameterized verification with automatically computed inductive assertions. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 221-234. Springer, Heidelberg (2001)
6. Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. TCS 147(1&2), 117-136 (1995)
7. Delzanno, G.: Constraint-based verification of parameterized cache coherence protocols. FMSD 23(3), 257-301 (2003)
8. Delzanno, G., Rosa-Velardo, F.: On the coverability and reachability languages of monotonic extensions of petri nets. Theor. Comput. Sci. 467, 12-29 (2013)
9. Delzanno, G., Sangnier, A., Traverso, R.: Parameterized verification of broadcat networks of register automata (technical report) (2013), http://verify.disi.unige.it/publications/
10. Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: On the complexity of parameterized reachability in reconfigurable broadcast networks. In: FSTTCS 2012. LIPIcs, vol. 18, pp. 289-300. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)
11. Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 313-327. Springer, Heidelberg (2010)
12. Delzanno, G., Sangnier, A., Zavattaro, G.: On the power of cliques in the parameterized verification of ad hoc networks. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 441-455. Springer, Heidelberg (2011)
13. Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinitestate systems. In: LICS 1998, pp. 70-80. IEEE Computer Society (1998)
14. Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS 1999, pp. 352-359. IEEE Computer Society (1999)
15. Fehnker, A., van Glabbeek, R., Höfner, P., McIver, A., Portmann, M., Tan, W.L.: Automated analysis of AODV using UPPAAL. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 173-187. Springer, Heidelberg (2012)
16. Fehnker, A., van Hoesel, L., Mader, A.: Modelling and verification of the LMAC protocol for wireless sensor networks. In: Davies, J., Gibbons, J. (eds.) IFM 2007. LNCS, vol. 4591, pp. 253-272. Springer, Heidelberg (2007)
17. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
18. German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675-735 (1992)
19. Joshi, S., König, B.: Applying the graph minor theorem to the verification of graph transformation systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 214-226. Springer, Heidelberg (2008)
20. Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329-363 (1994)
21. Lazic, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundam. Inform. 88(3), 251-274 (2008)
22. Prasad, K.V.S.: A calculus of broadcasting systems. Sci. Comput. Program. 25(2-3), 285-327 (1995)
23. Saksena, M., Wibling, O., Jonsson, B.: Graph grammar modeling and verification of ad hoc routing protocols. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 18-32. Springer, Heidelberg (2008)
24. Schnoebelen, P.: Revisiting ackermann-hardness for lossy counter machines and reset petri nets. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616-628. Springer, Heidelberg (2010)
25. Singh, A., Ramakrishnan, C.R., Smolka, S.A.: Query-based model checking of ad hoc network protocols. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 603-619. Springer, Heidelberg (2009)