On the complexity of parameterized reachability in reconfigurable broadcast networks

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 18, Issue , 2012, Pages 289-300

  Delzanno, Giorgio ^a   Sangnier, Arnaud ^b   Traverso, Riccardo ^a   Zavattaro, Gianluigi ^c  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Broadcast communication; Complexity; Parameterized verification

Indexed keywords

BROADCAST COMMUNICATION; BROADCAST NETWORKS; CARDINALITY CONSTRAINTS; COMPLEXITY; DYNAMIC TOPOLOGIES; PARAMETERIZED VERIFICATIONS; POLYNOMIAL TIME COMPLEXITY; VERIFICATION PROBLEMS;

POLYNOMIAL APPROXIMATION; SOFTWARE ENGINEERING;

PARAMETERIZATION;

EID: 84875642894     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2012.289     Document Type: Conference Paper

References (20)

1. Abdulla, P. A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2): 91-101 (1996)
2. Cheng, A., Esparza, J., Palsberg, J.: Complexity Results for 1-Safe Nets. Theor. Comput. Sci. 147(1&2): 117-136 (1995)
3. Delzanno, G., Sangnier, A., Zavattaro, G: Parameterized verification of Ad Hoc Networks. CONCUR'10: 313-327
4. Delzanno, G, Sangnier, A., Zavattaro, G: On the Power of Cliques in the Parameterized verification of Ad Hoc Networks. FOSSACS'11: 441-455
5. Delzanno, G, Sangnier, A., Zavattaro, G: Verification of Ad Hoc Networks with Node and Communication Failures. FORTE'12: 235-250
6. Delzanno, G, Sangnier, A., Traverso, R., Zavattaro, G: On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. Research Report hal-00740518, HAL, CNRS, France, 2012
7. Ene, C, Muntean, T.: A broadcast based calculus for Communicating Systems. IPDPS'01: 149
8. Esparza, J., Finkel, A., Mayr, R.: On the verification of Broadcast Protocols. LICS'99: 352-359
9. Fehnker, A., van Hoesel, L., Mader, A.: Modelling and verification of the LMAC protocol for wireless sensor networks. IFM'07: 253-272
10. Godskesen, J.C.: A calculus for Mobile Ad Hoc Networks. COORDINATION'07: 132-150
11. S. Joshi, B. König: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems. CAV'08: 214-226
12. Ladner, R. E.: The circuit value problem is logspace complete for P. SIGACT News: 18-20 (1977)
13. Lipton R.J.: The Reachability Problem Requires Exponential Space. Department of Computer Science. Research Report. Yale University. (1976)
14. Merro, M.: An observational theory for Mobile Ad Hoc Networks. Inf. Comput. 207(2): 194-208 (2009)
15. Nanz, S., Hankin, C: A Framework for security analysis of mobile wireless networks. TCS, 367(1-2):203-227 (2006)
16. Prasad, K.V.S.: A Calculus of Broadcasting Systems. SCP, 25(2-3): 285-327 (1995)
17. Saksena, M., Wibling, O., Jonsson, B.: Graph grammar modeling and verification of Ad Hoc Routing Protocols. TACAS'08: 18-32
18. Singh, A., Ramakrishnan, C. R., Smolka, S. A.: A process calculus for Mobile Ad Hoc Networks. COORDINATION'08: 296-314
19. Singh, A., Ramakrishnan, C. R, Smolka, S. A.: Query-Based model checking of Ad Hoc Network Protocols. CONCUR '09: 603-619
20. Rackoff C: The Covering and Boundedness Problems for Vector Addition Systems. TCS, 6:223-231 (1978)