메뉴 건너뛰기




Volumn 5201 LNCS, Issue , 2008, Pages 340-355

Mixing lossy and perfect fifo channels

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORK TOPOLOGY; NETWORK PROTOCOLS; SENSOR NETWORKS;

EID: 54249133449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_28     Document Type: Conference Paper
Times cited : (30)

References (21)
  • 4
    • 0002811218 scopus 로고    scopus 로고
    • Verifying programs with unreliable channels
    • Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91-101 (1996)
    • (1996) Information and Computation , vol.127 , Issue.2 , pp. 91-101
    • Abdulla, P.A.1    Jonsson, B.2
  • 5
    • 33845203433 scopus 로고    scopus 로고
    • Baier, C., Bertrand, N., Schnoebelen, Ph.: On computing fixpoints in wellstructured regular model checking, with applications to lossy channel systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), 4246, pp. 347-361. Springer, Heidelberg (2006)
    • Baier, C., Bertrand, N., Schnoebelen, Ph.: On computing fixpoints in wellstructured regular model checking, with applications to lossy channel systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 347-361. Springer, Heidelberg (2006)
  • 6
    • 37049008643 scopus 로고    scopus 로고
    • Verifying nondeterministic probabilistic channel systems against ω-regular linear-time propertie
    • Baier, C., Bertrand, N., Schnoebelen, Ph.: Verifying nondeterministic probabilistic channel systems against ω-regular linear-time propertie. ACM Trans. Computational Logic 9(1) (2007)
    • (2007) ACM Trans. Computational Logic , vol.9 , Issue.1
    • Baier, C.1    Bertrand, N.2    Schnoebelen, P.3
  • 8
    • 0020735797 scopus 로고
    • On communicating finite-state machines
    • Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30(2), 323-342 (1983)
    • (1983) Journal of the ACM , vol.30 , Issue.2 , pp. 323-342
    • Brand, D.1    Zafiropulo, P.2
  • 9
  • 10
    • 38349078294 scopus 로고    scopus 로고
    • Post embedding problem is not primitive recursive, with applications to channel systems
    • Arvind, V, Prasad, S, eds, FSTTCS 2007, Springer, Heidelberg
    • Chambart, P., Schnoebelen, Ph.: Post embedding problem is not primitive recursive, with applications to channel systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 265-276. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4855 , pp. 265-276
    • Chambart, P.1    Schnoebelen, P.2
  • 11
    • 47249148909 scopus 로고    scopus 로고
    • The ω-regular Post embedding problem
    • Amadio, R, ed, FOSSACS 2008, Springer, Heidelberg
    • Chambart, P., Schnoebelen, Ph.: The ω-regular Post embedding problem. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 97-111. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.4962 , pp. 97-111
    • Chambart, P.1    Schnoebelen, P.2
  • 12
    • 51549107969 scopus 로고    scopus 로고
    • The ordinal recursive complexity of lossy channel systems
    • IEEE Comp. Soc. Press, Los Alamitos
    • Chambart, P., Schnoebelen, Ph.: The ordinal recursive complexity of lossy channel systems. In: Proc. LICS 2008, IEEE Comp. Soc. Press, Los Alamitos (2008)
    • (2008) Proc. LICS
    • Chambart, P.1    Schnoebelen, P.2
  • 13
    • 0000689483 scopus 로고
    • Decidability of the termination problem for completely specificied protocols
    • Finkel, A.: Decidability of the termination problem for completely specificied protocols. Distributed Computing 7(3), 129-135 (1994)
    • (1994) Distributed Computing , vol.7 , Issue.3 , pp. 129-135
    • Finkel, A.1
  • 15
    • 82755175867 scopus 로고    scopus 로고
    • Jurdziński, M., Lazić, R.: Alternation-free modal mu-calculus for data trees. In: Proc. LICS 2007, pp. 131-140. IEEE Comp. Soc. Press, Los Alamitos (2007)
    • Jurdziński, M., Lazić, R.: Alternation-free modal mu-calculus for data trees. In: Proc. LICS 2007, pp. 131-140. IEEE Comp. Soc. Press, Los Alamitos (2007)
  • 16
    • 38149039027 scopus 로고    scopus 로고
    • Combining modal logics
    • Blackburn, P, van Benthem, J, Wolter, F, eds, ch. 15, Elsevier Science, Amsterdam
    • Kurucz, A.: Combining modal logics. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logics, ch. 15, vol. 3, pp. 869-926. Elsevier Science, Amsterdam (2006)
    • (2006) Handbook of Modal Logics , vol.3 , pp. 869-926
    • Kurucz, A.1
  • 19
    • 84987860312 scopus 로고    scopus 로고
    • On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Comp
    • Ouaknine, J., Worrell, J.: On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Comp. Science 3(1), 1-27 (2007)
    • (2007) Science , vol.3 , Issue.1 , pp. 1-27
    • Ouaknine, J.1    Worrell, J.2
  • 20
    • 54249107932 scopus 로고    scopus 로고
    • Pachl, J.K.: Protocol description and analysis based on a state transition model with channel expressions. In: Proc. PSTV 1987, pp. 207-219. North-Holland, Amsterdam (1987)
    • Pachl, J.K.: Protocol description and analysis based on a state transition model with channel expressions. In: Proc. PSTV 1987, pp. 207-219. North-Holland, Amsterdam (1987)
  • 21
    • 23944465568 scopus 로고    scopus 로고
    • The verification of probabilistic lossy channel systems
    • Baier, C, et al, eds, Validation of Stochastic Systems, A Guide to Current Research, Springer, Heidelberg
    • Schnoebelen, Ph.: The verification of probabilistic lossy channel systems. In: Baier, C., et al. (eds.) Validation of Stochastic Systems - A Guide to Current Research. LNCS, vol. 2925, pp. 445-465. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.2925 , pp. 445-465
    • Schnoebelen, P.1


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