메뉴 건너뛰기




Volumn , Issue , 2011, Pages 83-92

Quantitative automata model checking of autonomous stochastic hybrid systems

Author keywords

Finite state automata; LTL; Stochastic hybrid systems

Indexed keywords

AUTOMATA MODELS; DISCRETE TIME MARKOV CHAINS; DISCRETE-TIME; FINITE STATE AUTOMATA; INFINITE WORD; LINEAR TEMPORAL LOGIC; LINEAR TIME; LTL; QUANTITATIVE VERIFICATION; REACHABILITY; STOCHASTIC HYBRID SYSTEMS;

EID: 79956056278     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967701.1967715     Document Type: Conference Paper
Times cited : (40)

References (20)
  • 1
    • 79956016652 scopus 로고    scopus 로고
    • website
    • PRISM website. http://www.prismmodelchecker.org.
    • PRISM
  • 3
    • 52349103145 scopus 로고    scopus 로고
    • Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
    • A. Abate, M. Prandini, J. Lygeros, and S. Sastry. Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems. Automatica, 44(11):2724-2734, 2008.
    • (2008) Automatica , vol.44 , Issue.11 , pp. 2724-2734
    • Abate, A.1    Prandini, M.2    Lygeros, J.3    Sastry, S.4
  • 5
    • 35248884760 scopus 로고    scopus 로고
    • Reachability questions in piecewise deterministic Markov processes
    • O. Maler and A. Pnueli, editors, volume 2623 of LNCS, Springer-Verlag
    • M. Bujorianu and J. Lygeros. Reachability questions in piecewise deterministic Markov processes. In O. Maler and A. Pnueli, editors, HSCC, volume 2623 of LNCS, pages 126-140. Springer-Verlag, 2003.
    • (2003) HSCC , pp. 126-140
    • Bujorianu, M.1    Lygeros, J.2
  • 8
    • 9444288765 scopus 로고    scopus 로고
    • An optimal automata approach to LTL model checking of probabilistic systems
    • Logic for Programming, Artificial Intelligence, and Reasoning
    • J.-M. Couvreur, N. Saheb, and G. Sutre. An optimal automata approach to LTL model checking of probabilistic systems. In LPAR, volume 2850 of LNCS, pages 361-375, 2003. (Pubitemid 37231462)
    • (2003) Lecture Notes in Computer Science , Issue.2850 , pp. 361-375
    • Couvreur, J.-M.1    Saheb, N.2    Sutre, G.3
  • 9
    • 0037544463 scopus 로고    scopus 로고
    • Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes
    • J. Desharnais and P. Panangaden. Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. J. Log. Algebr. Program., 56(1-2):99-115, 2003.
    • (2003) J. Log. Algebr. Program. , vol.56 , Issue.1-2 , pp. 99-115
    • Desharnais, J.1    Panangaden, P.2
  • 10
    • 78349247503 scopus 로고    scopus 로고
    • Satisfaction meets expectations - Computing expected values of probabilistic hybrid systems with SMT
    • M. Fränzle, T. Teige, and A. Eggers. Satisfaction meets expectations - computing expected values of probabilistic hybrid systems with SMT. In IFM, pages 168-182, 2010.
    • (2010) IFM , pp. 168-182
    • Fränzle, M.1    Teige, T.2    Eggers, A.3
  • 11
    • 0003096318 scopus 로고
    • A logic for reasoning about time and reliability
    • 10.1007/BF01211866
    • H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512-535, 1994. 10.1007/BF01211866.
    • (1994) Formal Aspects of Computing , vol.6 , pp. 512-535
    • Hansson, H.1    Jonsson, B.2
  • 12
    • 74049105653 scopus 로고    scopus 로고
    • The ins and outs of the probabilistic model checker MRMC
    • J.-P. Katoen, E. M. Hahn, H. Hermanns, D. N. Jansen, and I. Zapreev. The ins and outs of the probabilistic model checker MRMC. In QEST, pages 167-176, 2009.
    • (2009) QEST , pp. 167-176
    • Katoen, J.-P.1    Hahn, E.M.2    Hermanns, H.3    Jansen, D.N.4    Zapreev, I.5
  • 15
    • 33947632934 scopus 로고    scopus 로고
    • Stochastic reachability: Theory and numerical approximation
    • C. Cassandras and J. Lygeros, editors, Taylor & Francis Group/CRC Press
    • M. Prandini and J. Hu. Stochastic reachability: Theory and numerical approximation. In C. Cassandras and J. Lygeros, editors, Stochastic hybrid systems, Automation and Control Engineering Series, pages 107-138. Taylor & Francis Group/CRC Press, 2006.
    • (2006) Stochastic Hybrid Systems, Automation and Control Engineering Series , pp. 107-138
    • Prandini, M.1    Hu, J.2
  • 17
    • 77953039642 scopus 로고    scopus 로고
    • On the connections between PCTL and dynamic programming
    • ACM
    • F. Ramponi, D. Chatterjee, S. Summers, and J. Lygeros. On the connections between PCTL and dynamic programming. In HSCC, pages 253-262. ACM, 2010.
    • (2010) HSCC , pp. 253-262
    • Ramponi, F.1    Chatterjee, D.2    Summers, S.3    Lygeros, J.4
  • 18
    • 78249282613 scopus 로고    scopus 로고
    • Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem
    • S. Summers and J. Lygeros. Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem. Automatica, 46(12):1951-1961, 2010.
    • (2010) Automatica , vol.46 , Issue.12 , pp. 1951-1961
    • Summers, S.1    Lygeros, J.2
  • 19
    • 0022987223 scopus 로고
    • Automata-theoretic approach to automatic program verification
    • M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS, pages 332-344, 1986. (Pubitemid 17563569)
    • (1986) LICS , pp. 332-344
    • Vardi Moshe, Y.1    Wolper Pierre2
  • 20
    • 77954990493 scopus 로고    scopus 로고
    • Safety verification for probabilistic hybrid systems
    • volume 6174 of LNCS, Springer Verlag
    • L. Zhang, Z. She, S. Ratschan, H. Hermanns, and E. M. Hahn. Safety verification for probabilistic hybrid systems. In CAV, volume 6174 of LNCS, pages 196-211. Springer Verlag, 2010.
    • (2010) CAV , pp. 196-211
    • Zhang, L.1    She, Z.2    Ratschan, S.3    Hermanns, H.4    Hahn, E.M.5


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