메뉴 건너뛰기




Volumn 6269 LNCS, Issue , 2010, Pages 313-327

Parameterized verification of ad hoc networks

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENT NODES; ARBITRARY NUMBER; COMMUNICATION GRAPHS; COMMUNICATION TOPOLOGIES; DECISION PROBLEMS; FINITE STATE AUTOMATA; FORMAL MODEL; INITIAL CONFIGURATION; PARAMETERIZED VERIFICATIONS; PATH TOPOLOGY; REACHABILITY; SELECTIVE BROADCAST; SINGLE-HOP; VERIFICATION PROBLEMS;

EID: 78249249265     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15375-4_22     Document Type: Conference Paper
Times cited : (90)

References (23)
  • 1
    • 0029724779 scopus 로고    scopus 로고
    • General decidability theorems for infinite-state systems
    • Abdulla, P.A., Čerāns, C., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313-321 (1996)
    • (1996) LICS 1996 , pp. 313-321
    • Abdulla, P.A.1    Čerans, C.2    Jonsson, B.3    Tsay, Y.-K.4
  • 2
    • 0034632154 scopus 로고    scopus 로고
    • Algorithmic analysis of programs with well quasi-ordered domains
    • Abdulla, P.A., Čerāns, C., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1-2), 109-127 (2000)
    • (2000) Inf. Comput. , vol.160 , Issue.1-2 , pp. 109-127
    • Abdulla, P.A.1    Čerans, C.2    Jonsson, B.3    Tsay, Y.-K.4
  • 3
    • 0002811218 scopus 로고    scopus 로고
    • Verifying programs with unreliable channels
    • Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91-101 (1996)
    • (1996) Inf. Comput. , vol.127 , Issue.2 , pp. 91-101
    • Abdulla, P.A.1    Jonsson, B.2
  • 5
    • 84987491031 scopus 로고
    • Subgraphs and well quasi ordering
    • Ding, G.: Subgraphs and well quasi ordering. J. of Graph Theory 16(5), 489-502 (1992)
    • (1992) J. of Graph Theory , vol.16 , Issue.5 , pp. 489-502
    • Ding, G.1
  • 6
    • 85007553476 scopus 로고    scopus 로고
    • On model checking for non-deterministic infinite-state systems
    • Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: LICS 1998, pp. 70-80 (1998)
    • (1998) LICS 1998 , pp. 70-80
    • Emerson, E.A.1    Namjoshi, K.S.2
  • 7
    • 84981266949 scopus 로고    scopus 로고
    • A broadcast based calculus for Communicating Systems
    • Ene, C., Muntean, T.: A broadcast based calculus for Communicating Systems. In: IPDPS 2001, p. 149 (2001)
    • (2001) IPDPS 2001 , pp. 149
    • Ene, C.1    Muntean, T.2
  • 8
    • 0032597490 scopus 로고    scopus 로고
    • On the verification of Broadcast Protocols
    • Esparza, J., Finkel, A., Mayr, R.: On the verification of Broadcast Protocols. In: LICS 1999, pp. 352-359 (1999)
    • (1999) LICS 1999 , pp. 352-359
    • Esparza, J.1    Finkel, A.2    Mayr, R.3
  • 9
    • 0041151950 scopus 로고
    • Decidability issues for Petri nets - A survey
    • Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Bulletin of the EATCS 52, 245-262 (1994)
    • (1994) Bulletin of the EATCS , vol.52 , pp. 245-262
    • Esparza, J.1    Nielsen, M.2
  • 10
    • 78249251564 scopus 로고    scopus 로고
    • Some applications of Petri Nets to the analysis of parameterised systems
    • Esparza, J.: Some applications of Petri Nets to the analysis of parameterised systems. Talk at WISP 2003 (2003)
    • (2003) Talk at WISP 2003
    • Esparza, J.1
  • 11
    • 38149130488 scopus 로고    scopus 로고
    • Modelling and verification of the LMAC protocol for wireless sensor networks
    • Davies, J., Gibbons, J. (eds.) IFM 2007. Springer, Heidelberg
    • 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)
    • (2007) LNCS , vol.4591 , pp. 253-272
    • Fehnker, A.1    Van Hoesel, L.2    Mader, A.3
  • 12
    • 0034911369 scopus 로고    scopus 로고
    • Well-structured transition systems everywhere!
    • Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! TCS 256(1-2), 63-92 (2001)
    • (2001) TCS , vol.256 , Issue.1-2 , pp. 63-92
    • Finkel, A.1    Schnoebelen, P.2
  • 13
    • 37149042964 scopus 로고    scopus 로고
    • A calculus for Mobile Ad Hoc Networks
    • Murphy, A.L., Vitek, J. (eds.) COORDINATION 2007. Springer, Heidelberg
    • Godskesen, J.C.: A calculus for Mobile Ad Hoc Networks. In: Murphy, A.L., Vitek, J. (eds.) COORDINATION 2007. LNCS, vol. 4467, pp. 132-150. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4467 , pp. 132-150
    • Godskesen, J.C.1
  • 14
    • 77949435116 scopus 로고    scopus 로고
    • An observational theory for Mobile Ad Hoc Networks
    • Merro, M.: An observational theory for Mobile Ad Hoc Networks. Inf. Comput. 207(2), 194-208 (2009)
    • (2009) Inf. Comput. , vol.207 , Issue.2 , pp. 194-208
    • Merro, M.1
  • 15
    • 48249156600 scopus 로고    scopus 로고
    • On boundedness in depth in the pi-calculus
    • Meyer, R.: On boundedness in depth in the pi-calculus. In: IFIP TCS 2008, pp. 477-489 (2008)
    • (2008) IFIP TCS 2008 , pp. 477-489
    • Meyer, R.1
  • 16
    • 33646122471 scopus 로고    scopus 로고
    • Towards a calculus for wireless systems
    • Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. ENTCS 158, 331-353 (2006)
    • (2006) ENTCS , vol.158 , pp. 331-353
    • Mezzetti, N.1    Sangiorgi, D.2
  • 19
    • 0029535822 scopus 로고
    • A Calculus of Broadcasting Systems
    • Prasad, K.V.S.: A Calculus of Broadcasting Systems. Sci. of Comp. Prog. 25(2-3), 285-327 (1995)
    • (1995) Sci. of Comp. Prog. , vol.25 , Issue.2-3 , pp. 285-327
    • Prasad, K.V.S.1
  • 20
    • 47249096255 scopus 로고    scopus 로고
    • Graph grammar modeling and verification of Ad Hoc Routing Protocols
    • Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. Springer, Heidelberg
    • 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)
    • (2008) LNCS , vol.4963 , pp. 18-32
    • Saksena, M.1    Wibling, O.2    Jonsson, B.3
  • 21
    • 45749140094 scopus 로고    scopus 로고
    • A process calculus for Mobile Ad Hoc Networks
    • Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. Springer, Heidelberg
    • Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for Mobile Ad Hoc Networks. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 296-314. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5052 , pp. 296-314
    • Singh, A.1    Ramakrishnan, C.R.2    Smolka, S.A.3
  • 22
    • 70349860010 scopus 로고    scopus 로고
    • Query-Based model checking of Ad Hoc Network Protocols
    • Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. Springer, Heidelberg
    • 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-661. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5710 , pp. 603-661
    • Singh, A.1    Ramakrishnan, C.R.2    Smolka, S.A.3
  • 23
    • 77951495561 scopus 로고    scopus 로고
    • Forward analysis of depth-bounded processes
    • Ong, L. (ed.) FOSSACS 2010. Springer, Heidelberg
    • Wies, T., Zufferey, D., Henzinger, T.A.: Forward analysis of depth-bounded processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 94-108. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6014 , pp. 94-108
    • Wies, T.1    Zufferey, D.2    Henzinger, T.A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.