메뉴 건너뛰기




Volumn 3114, Issue , 2004, Pages 202-215

Statistical model checking of black-box probabilistic systems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; INTELLIGENT SYSTEMS; MONTE CARLO METHODS; NUMERICAL METHODS; STATISTICS; STOCHASTIC SYSTEMS; TESTING;

EID: 35048875856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_16     Document Type: Article
Times cited : (231)

References (16)
  • 2
    • 85030836404 scopus 로고
    • Model-checking for probabilistic real-time systems
    • extended abstract Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP'91), Springer
    • R. Alur, C. Courcoubetis, and D. Dill. Model-checking for probabilistic real-time systems (extended abstract). In Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP'91), volume 510 of LNCS, pages 115-126. Springer, 1991.
    • (1991) LNCS , vol.510 , pp. 115-126
    • Alur, R.1    Courcoubetis, C.2    Dill, D.3
  • 4
    • 84951056897 scopus 로고    scopus 로고
    • Symbolic model checking for probabilistic processes
    • Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Springer
    • C. Baier, E. M. Clarke, V. Hartonas-Garmhausen, M. Z. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), volume 1256 of LNCS, pages 430-440. Springer, 1997.
    • (1997) LNCS , vol.1256 , pp. 430-440
    • Baier, C.1    Clarke, E.M.2    Hartonas-Garmhausen, V.3    Kwiatkowska, M.Z.4    Ryan, M.5
  • 5
    • 41149144239 scopus 로고    scopus 로고
    • Approximate symbolic model checking of continuous-time markov chains
    • International Conference on Concurrency Theory, Springer, August
    • C. Baier, J. P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time markov chains. In International Conference on Concurrency Theory, volume 1664 of LNCS, pages 146-161. Springer, August 1999.
    • (1999) LNCS , vol.1664 , pp. 146-161
    • Baier, C.1    Katoen, J.P.2    Hermanns, H.3
  • 6
    • 21844505024 scopus 로고    scopus 로고
    • Model checking of probabilistic and nondeterministic systems
    • Proceedings of 15th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95)
    • A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proceedings of 15th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95), volume 1026 of LNCS.
    • LNCS , vol.1026
    • Bianco, A.1    De Alfaro, L.2
  • 7
    • 84944264717 scopus 로고    scopus 로고
    • Approximate Probabilistic Model Checking
    • Proceedings of Fifth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'04), Springer
    • T. Herault, R. Lassaigne, F. Magniette, and S. Peyronnet. Approximate Probabilistic Model Checking. In Proceedings of Fifth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'04), volume 2937 of LNCS, pages 73-84. Springer, 2004.
    • (2004) LNCS , vol.2937 , pp. 73-84
    • Herault, T.1    Lassaigne, R.2    Magniette, F.3    Peyronnet, S.4
  • 14
    • 84885235139 scopus 로고    scopus 로고
    • Verifying quantitative properties of continuous probabilistic timed automata
    • International Conference on Concurrency Theory (CONCUR'00), Springer
    • M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Verifying quantitative properties of continuous probabilistic timed automata. In International Conference on Concurrency Theory (CONCUR'00), volume 1877 of LNCS, pages 123-137. Springer, 2000.
    • (2000) LNCS , vol.1877 , pp. 123-137
    • Kwiatkowska, M.Z.1    Norman, G.2    Segala, R.3    Sproston, J.4
  • 16
    • 84921391802 scopus 로고    scopus 로고
    • Probabilistic verification of discrete event systems using acceptance sampling
    • 14th International Conference on Computer Aided Verification (CAV'02), Springer
    • H. L. S. Younes and R. G. Simmons. Probabilistic verification of discrete event systems using acceptance sampling. In 14th International Conference on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 223-235. Springer, 2002.
    • (2002) LNCS , vol.2404 , pp. 223-235
    • Younes, H.L.S.1    Simmons, R.G.2


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