메뉴 건너뛰기




Volumn 3829 LNCS, Issue , 2005, Pages 177-195

Counterexamples for timed probabilistic reachability

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MARKOV PROCESSES; PROBABILITY; PROGRAM DEBUGGING; TIME VARYING SYSTEMS;

EID: 33745460936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603009_15     Document Type: Conference Paper
Times cited : (29)

References (19)
  • 3
    • 84957369657 scopus 로고    scopus 로고
    • Verifying continuous-time Markov chains
    • Rajeev Alur, Thomas A. Henzinger, eds.: New Brunswick, NJ, USA, Springer Verlag LNCS
    • A. Aziz, K. Sanwal, V. Singhai, R. K. Brayton: Verifying continuous-time Markov chains. In Rajeev Alur, Thomas A. Henzinger, eds.: Eighth International Conference on Computer Aided Verification CAV. Volume 1102., New Brunswick, NJ, USA, Springer Verlag LNCS (1996) 269-276
    • (1996) Eighth International Conference on Computer Aided Verification CAV , vol.1102 , pp. 269-276
    • Aziz, A.1    Sanwal, K.2    Singhai, V.3    Brayton, R.K.4
  • 6
    • 41149144239 scopus 로고    scopus 로고
    • Approximate symbolic model checking of continuous-time Markov chains
    • Springer Verlag LNCS
    • Baier, C., Katoen, J.P., Hermanns, H.: Approximate symbolic model checking of continuous-time Markov chains. In: International Conference on Concurrency Theory, Springer Verlag LNCS (1999) 146-161
    • (1999) International Conference on Concurrency Theory , pp. 146-161
    • Baier, C.1    Katoen, J.P.2    Hermanns, H.3
  • 12
    • 10444262814 scopus 로고    scopus 로고
    • Directed explicit-state model checking in the validation of communication protocols
    • Edelkamp, S., Lafuente, A.L., Leue, S.: Directed explicit-state model checking in the validation of communication protocols. Software Tools for Technology Transfer 5 (2004) 247-267
    • (2004) Software Tools for Technology Transfer , vol.5 , pp. 247-267
    • Edelkamp, S.1    Lafuente, A.L.2    Leue, S.3
  • 13
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1


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