메뉴 건너뛰기




Volumn 8053 LNCS, Issue , 2013, Pages 137-151

More or less true: DCTL for continuous-time MDPs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TREE LOGIC; CONTINUOUS TIME MARKOV CHAIN; CONTINUOUS-TIME; CONTINUOUS-TIME MARKOV DECISION PROCESS; MODEL CHECKING ALGORITHM; REAL VALUES;

EID: 84882740238     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40229-6_10     Document Type: Conference Paper
Times cited : (3)

References (9)
  • 3
    • 27644578953 scopus 로고    scopus 로고
    • Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
    • Baier, C., Hermanns, H., Katoen, J.-P., Haverkort, B.R.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theoretical Computer Science 345(1), 2-26 (2005)
    • (2005) Theoretical Computer Science , vol.345 , Issue.1 , pp. 2-26
    • Baier, C.1    Hermanns, H.2    Katoen, J.-P.3    Haverkort, B.R.4
  • 6
    • 70350630737 scopus 로고    scopus 로고
    • Delayed nondeterminism in continuous-time Markov decision processes
    • de Alfaro, L. (ed.) FOSSACS 2009. Springer, Heidelberg
    • Neuhäußer, M.R., Stoelinga, M., Katoen, J.-P.: Delayed nondeterminism in continuous-time Markov decision processes. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 364-379. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5504 , pp. 364-379
    • Neuhäußer, M.R.1    Stoelinga, M.2    Katoen, J.-P.3


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