메뉴 건너뛰기




Volumn 5394 LNCS, Issue , 2009, Pages 129-148

Significant diagnostic counterexamples in probabilistic model checking

Author keywords

[No Author keywords available]

Indexed keywords

DEBUGGING INFORMATION; MARKOV CHAIN; MARKOV DECISION PROCESS; NOVEL TECHNIQUES; PROBABILISTIC MODEL CHECKING; REACHABILITY; STRONGLY CONNECTED COMPONENT;

EID: 67650340172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01702-5_15     Document Type: Conference Paper
Times cited : (37)

References (20)
  • 4
    • 67650295442 scopus 로고    scopus 로고
    • Counterexamples for model checking of markov decision processes
    • [AL07], University of Konstanz, December
    • [AL07] Aljazzar, H., Leue, S.: Counterexamples for model checking of markov decision processes. Computer Science Technical Report soft-08-101, University of Konstanz (December 2007)
    • (2007) Computer Science Technical Report soft-08-01
    • Aljazzar, H.1    Leue, S.2
  • 6
    • 21844505024 scopus 로고
    • Model Checking of Probabilistic and Nondeterministic Systems
    • Foundations of Software Technology and Theoretical Computer Science
    • [BdA95] Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Goos, G., Hartmanis, J., van Leeuwen, J. (eds.) Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1995), vol. 1026, pp. 499-513 (1995) (Pubitemid 126012732)
    • (1995) LECTURE NOTES IN COMPUTER SCIENCE , Issue.1026 , pp. 499-513
    • Bianco, A.1    De Alfaro, L.2
  • 7
    • 0001700171 scopus 로고
    • A Markovian decision process
    • [Bel57] Bellman, R.E.: A Markovian decision process. J. Math. Mech. 6, 679-684 (1957)
    • (1957) J. Math. Mech. , Issue.6 , pp. 679-684
    • Bellman, R.E.1
  • 12
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • [Epp98]
    • [Epp98] Eppstein, D.: Finding the k shortest paths. SIAM Journal of Computing, 652-673 (1998)
    • (1998) SIAM Journal of Computing , pp. 652-673
    • Eppstein, D.1
  • 15
    • 38149103404 scopus 로고    scopus 로고
    • Providing evidence of likely being on time- counterexample generation for ctmc model checking
    • [HK07b], In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.), LNCS, Springer, Heidelberg
    • [HK07b] Han, T., Katoen, J.-P.: Providing evidence of likely being on time- counterexample generation for ctmc model checking. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol.4762, pp. 331-346. Springer, Heidelberg (2007)
    • (2007) ATVA 2007 , vol.4762 , pp. 331-346
    • Han, T.1    Katoen, J.-P.2
  • 18
    • 21144435765 scopus 로고    scopus 로고
    • Probabilistic Automata: System Types, Parallel Composition and Comparison
    • Validation of Stochastic Systems
    • [SdV04] Sokolova, A., de Vink, E.P.: Probabilistic automata: System types, parallel composition and comparison. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.2925, pp. 1-43. Springer, Heidelberg (2004) (Pubitemid 39224333)
    • (2004) LECTURE NOTES IN COMPUTER SCIENCE , Issue.2925 , pp. 1-43
    • Sokolova, A.1    De Vink, E.P.2
  • 19
    • 0001609136 scopus 로고
    • Probabilistic simulations for probabilistic processes
    • [SL95]
    • [SL95] Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2(2), 250-273 (1995)
    • (1995) Nordic Journal of Computing 2 , Issue.2 , pp. 250-273
    • Segala, R.1    Lynch, N.2


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