메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 264-267

Improving stochastic model checking with stochastic bounds

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MARKOV PROCESSES; MATHEMATICAL MODELS; NUMERICAL METHODS; PROBABILITY DISTRIBUTIONS;

EID: 33947102691     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/saintw.2005.1620026     Document Type: Conference Paper
Times cited : (1)

References (13)
  • 1
    • 2942582788 scopus 로고    scopus 로고
    • An algorithm to bound functionals of Markov chains with large state space. Int
    • Boca Raton, Florida
    • O. Abu-Amsha, J-M. Vincent: An algorithm to bound functionals of Markov chains with large state space. Int: 4th INFORMS Conference on Telecommunications, Boca Raton, Florida, (1998)
    • (1998) 4th INFORMS Conference on Telecommunications
    • Abu-Amsha, O.1    Vincent, J.-M.2
  • 3
    • 84957369657 scopus 로고    scopus 로고
    • A. Aziz, K. Sanwal, V. Singhal, and R. Brayton Verifying continuous time Markov chains In Proc. CAV'96, pp 269-276, 1996 (Available as 1102 of LNCS, Springer Verlag)
    • A. Aziz, K. Sanwal, V. Singhal, and R. Brayton Verifying continuous time Markov chains In Proc. CAV'96, pp 269-276, 1996 (Available as Volume 1102 of LNCS, Springer Verlag)
  • 4
    • 84952766053 scopus 로고    scopus 로고
    • An algorithmic and numerical approach to bound the performance of high speed networks
    • Fort Worth, USA, pp
    • M. Benmammoun, J.M. Fourneau, N. Pekergin, A. Troubnikoff, "An algorithmic and numerical approach to bound the performance of high speed networks", IEEE MASCOTS 2002, Fort Worth, USA, pp. 375-382.
    • IEEE MASCOTS 2002 , pp. 375-382
    • Benmammoun, M.1    Fourneau, J.M.2    Pekergin, N.3    Troubnikoff, A.4
  • 5
    • 85085401292 scopus 로고
    • Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models
    • Courtois P.J., Semal P.: Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models. In: IEEE JSAC, V4, N6, (1986)
    • (1986) IEEE JSAC , vol.4
    • Courtois, P.J.1    Semal, P.2
  • 8
    • 0003096318 scopus 로고
    • A logic for reasoning about time and reliability. Form. Asp. of Comp
    • H. Hansson and B.Jonsson. A logic for reasoning about time and reliability. Form. Asp. of Comp. 6: 512-535, 1994.
    • (1994) , vol.6 , pp. 512-535
    • Hansson, H.1    Jonsson, B.2
  • 9
    • 0036922038 scopus 로고    scopus 로고
    • B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier Model Checking Performability Properties In Proc. DSN 2002, IEEE CS Press, 2002.
    • B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier Model Checking Performability Properties In Proc. DSN 2002, IEEE CS Press, 2002.
  • 10
    • 84863981780 scopus 로고    scopus 로고
    • M. Kwiatkowska, G. Norman and D. Parker PRISM: Probabilistic Symbolic Model Checker In Proc. TOOLS 2002, 2324 of LNCS, pages 200-204, Springer-Verlag April 2002
    • M. Kwiatkowska, G. Norman and D. Parker PRISM: Probabilistic Symbolic Model Checker In Proc. TOOLS 2002, volume 2324 of LNCS, pages 200-204, Springer-Verlag April 2002
  • 12
    • 0003716296 scopus 로고
    • Comparison Methods for Queues and Other Stochastic Models
    • Berlin, Germany
    • Stoyan D.: Comparison Methods for Queues and Other Stochastic Models. John Wiley & Sons, Berlin, Germany, (1983)
    • (1983) John Wiley & Sons
    • Stoyan, D.1
  • 13
    • 2942543126 scopus 로고    scopus 로고
    • Error bound analysis for queueing networks
    • Lausanne
    • Van Dijk N.: Error bound analysis for queueing networks", In: Performane 96 Tutorials, Lausanne, (1996)
    • (1996) Performane 96 Tutorials
    • Van Dijk, N.1


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