메뉴 건너뛰기




Volumn 5643 LNCS, Issue , 2009, Pages 709-714

PAT: Towards flexible verification under fairness

Author keywords

[No Author keywords available]

Indexed keywords

CURRENT PRACTICES; DISTRIBUTED SYSTEMS; EFFICIENT SYSTEMS; EMPIRICAL EVALUATIONS; FAIRNESS CONSTRAINTS; MODEL CHECK; MODEL CHECKER; SYSTEM ANALYSIS; UNIFIED ALGORITHM;

EID: 70350222211     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_59     Document Type: Conference Paper
Times cited : (310)

References (10)
  • 1
    • 84870845706 scopus 로고    scopus 로고
    • Self-stabilizing Population Protocols
    • Anderson, J.H, Prencipe, G, Wattenhofer, R, eds, OPODIS 2005, Springer, Heidelberg
    • Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing Population Protocols. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 103-117. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3974 , pp. 103-117
    • Angluin, D.1    Aspnes, J.2    Fischer, M.J.3    Jiang, H.4
  • 2
    • 84885803519 scopus 로고    scopus 로고
    • Self-stabilizing Leader Election in Networks of Finite-state Anonymous Agents
    • Shvartsman, M.M.A.A, ed, OPODIS 2006, Springer, Heidelberg
    • Fischer, M.J., Jiang, H.: Self-stabilizing Leader Election in Networks of Finite-state Anonymous Agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 395-409. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4305 , pp. 395-409
    • Fischer, M.J.1    Jiang, H.2
  • 3
    • 26944460915 scopus 로고    scopus 로고
    • Geldenhuys, J., Valmari, A.: More efficient on-the-fly LTL verification with Tarjan's algorithm. Theoritical Computer Science 345(1), 60-82 (2005)
    • Geldenhuys, J., Valmari, A.: More efficient on-the-fly LTL verification with Tarjan's algorithm. Theoritical Computer Science 345(1), 60-82 (2005)
  • 4
    • 84947926519 scopus 로고    scopus 로고
    • Henzinger, M.R., Telle, J.A.: Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, 1097, pp. 16-27. Springer, Heidelberg (1996)
    • Henzinger, M.R., Telle, J.A.: Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 16-27. Springer, Heidelberg (1996)
  • 8
    • 0017472779 scopus 로고
    • Proving the Correctness of Multiprocess Programs
    • Lamport, L.: Proving the Correctness of Multiprocess Programs. IEEE Transactions on Software Engineering 3(2), 125-143 (1977)
    • (1977) IEEE Transactions on Software Engineering , vol.3 , Issue.2 , pp. 125-143
    • Lamport, L.1
  • 9
    • 85034565451 scopus 로고
    • Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
    • Even, S, Kariv, O, eds, ICALP 1981, Springer, Heidelberg
    • Lehmann, D.J., Pnueli, A., Stavi, J.: Impartiality, Justice and Fairness: The Ethics of Concurrent Termination. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 264-277. Springer, Heidelberg (1981)
    • (1981) LNCS , vol.115 , pp. 264-277
    • Lehmann, D.J.1    Pnueli, A.2    Stavi, J.3
  • 10
    • 70350213791 scopus 로고    scopus 로고
    • Towards a Toolkit for Flexible and Efficient Verification under Fairness
    • Technical Report TRB2/09, National Univ. of Singapore December
    • Sun, J., Liu, Y., Dong, J.S., Pang, J.: Towards a Toolkit for Flexible and Efficient Verification under Fairness. Technical Report TRB2/09, National Univ. of Singapore (December 2008)
    • (2008)
    • Sun, J.1    Liu, Y.2    Dong, J.S.3    Pang, J.4


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