메뉴 건너뛰기




Volumn , Issue , 2010, Pages 273-281

Fortuna: Model checking priced probabilistic timed automata

Author keywords

Priced timed automata; Probabilistic reachability; Probabilistic timed automata; Symbolic algorithms

Indexed keywords

COST INCREMENT; DESIGN TRADEOFF; FIREWIRE PROTOCOLS; IEEE 802.11S; PROBABILISTIC TIMED AUTOMATA; REACHABILITY; SCHEDULING PROBLEM; SYMBOLIC ALGORITHMS; TIMED AUTOMATA;

EID: 78649471655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2010.41     Document Type: Conference Paper
Times cited : (18)

References (22)
  • 1
    • 48949095115 scopus 로고    scopus 로고
    • Verification technology transfer
    • ser. LNCS, O. Grumberg and H. Veith, Eds., Springer
    • R. Kurshan, "Verification technology transfer," in 25 Years of Model Checking, ser. LNCS, O. Grumberg and H. Veith, Eds., vol. 5000. Springer, 2008, pp. 46-64.
    • (2008) 25 Years of Model Checking , vol.5000 , pp. 46-64
    • Kurshan, R.1
  • 2
    • 35048862279 scopus 로고    scopus 로고
    • A tutorial on uppaal
    • ser. LNCS, M. Bernardo and F. Corradini, Eds.. Berlin: Springer
    • G. Behrmann, A. David, and K. Larsen, "A tutorial on uppaal." in SFM, ser. LNCS, M. Bernardo and F. Corradini, Eds., vol. 3185. Berlin: Springer, 2004, pp. 200-236.
    • (2004) SFM , vol.3185 , pp. 200-236
    • Behrmann, G.1    David, A.2    Larsen, K.3
  • 4
    • 70349958924 scopus 로고    scopus 로고
    • Prism: Probabilistic model checking for performance and reliability analysis
    • M. Kwiatkowska, G. Norman, and D. Parker, "Prism: Probabilistic model checking for performance and reliability analysis," ACM SIGMETRICS Performance Evaluation Review, vol. 36, no. 4, pp. 40-45, 2009.
    • (2009) ACM SIGMETRICS Performance Evaluation Review , vol.36 , Issue.4 , pp. 40-45
    • Kwiatkowska, M.1    Norman, G.2    Parker, D.3
  • 6
    • 78649485701 scopus 로고    scopus 로고
    • [Online] Available
    • [Online]. Available: http://www.mbsd.cs.ru.nl/publications/papers/fvaan/ zeroconf/full.html
  • 7
    • 1542330110 scopus 로고    scopus 로고
    • Cost-optimization of the ipv4 zeroconf protocol
    • IEEE Computer Society
    • H. Bohnenkamp, P. van der Stok, H. Hermanns, and F. Vaandrager, "Cost-optimization of the ipv4 zeroconf protocol," in DSN. IEEE Computer Society, 2003, pp. 531-540.
    • (2003) DSN , pp. 531-540
    • Bohnenkamp, H.1    Van Der Stok, P.2    Hermanns, H.3    Vaandrager, F.4
  • 8
    • 41149175625 scopus 로고    scopus 로고
    • Probably on time and within budget: On reachability in priced probabilistic timed automata
    • IEEE Computer Society
    • J. Berendsen, D. Jansen, and J.-P. Katoen, "Probably on time and within budget: On reachability in priced probabilistic timed automata," in QEST. IEEE Computer Society, 2006, pp. 311-322.
    • (2006) QEST , pp. 311-322
    • Berendsen, J.1    Jansen, D.2    Katoen, J.-P.3
  • 9
    • 33746043408 scopus 로고    scopus 로고
    • Performance analysis of probabilistic timed automata using digital clocks
    • M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston, "Performance analysis of probabilistic timed automata using digital clocks," Formal Methods in System Design, vol. 29, no. 1, pp. 33-78, 2006.
    • (2006) Formal Methods in System Design , vol.29 , Issue.1 , pp. 33-78
    • Kwiatkowska, M.1    Norman, G.2    Parker, D.3    Sproston, J.4
  • 13
    • 70350459891 scopus 로고    scopus 로고
    • Stochastic games for verification of probabilistic timed automata
    • ser. LNCS, J. Ouaknine and F. Vaandrager, Eds., Springer
    • M. Kwiatkowska, G. Norman, and D. Parker, "Stochastic games for verification of probabilistic timed automata," in FORMATS, ser. LNCS, J. Ouaknine and F. Vaandrager, Eds., vol. 5813. Springer, 2009, pp. 212-227.
    • (2009) FORMATS , vol.5813 , pp. 212-227
    • Kwiatkowska, M.1    Norman, G.2    Parker, D.3
  • 14
    • 84862908408 scopus 로고    scopus 로고
    • Symbolic model checking for probabilistic timed automata
    • DOI 10.1016/j.ic.2007.01.004, PII S0890540107000077
    • M. Kwiatkowska, G. Norman, J. Sproston, and F. Wang, "Symbolic model checking for probabilistic timed automata," Information and Computation, vol. 205, no. 7, pp. 1027-1077, 2007. (Pubitemid 46765041)
    • (2007) Information and Computation , vol.205 , Issue.7 , pp. 1027-1077
    • Kwiatkowska, M.1    Norman, G.2    Sproston, J.3    Wang, F.4
  • 15
    • 74049146186 scopus 로고    scopus 로고
    • A modest approach to checking probabilistic timed automata
    • IEEE Computer Society Press
    • A. Hartmanns and H. Hermanns, "A modest approach to checking probabilistic timed automata," in QEST. IEEE Computer Society Press, 2009, pp. 187-196.
    • (2009) QEST , pp. 187-196
    • Hartmanns, A.1    Hermanns, H.2
  • 16
    • 67650248513 scopus 로고    scopus 로고
    • Undecidability of costbounded reachability in priced probabilistic timed automata
    • ser. LNCS, J. Chen and S. Cooper, Eds., Springer
    • J. Berendsen, T. Chen, and D. Jansen, "Undecidability of costbounded reachability in priced probabilistic timed automata," in TAMC, ser. LNCS, J. Chen and S. Cooper, Eds., vol. 5532. Springer, 2009, pp. 128-137.
    • (2009) TAMC , vol.5532 , pp. 128-137
    • Berendsen, J.1    Chen, T.2    Jansen, D.3
  • 17
    • 78649457095 scopus 로고    scopus 로고
    • Institute for Computing and Information Sciences, Radboud University Nijmegen, Report. [Online]. Available
    • J. Berendsen, D. Jansen, and F. Vaandrager, "Fortuna: Model checking priced probabilistic timed automata," Institute for Computing and Information Sciences, Radboud University Nijmegen, Report, 2009. [Online]. Available: http://www.cs.ru.nl/J.Berendsen/fortuna/
    • (2009) Fortuna: Model Checking Priced Probabilistic Timed Automata
    • Berendsen, J.1    Jansen, D.2    Vaandrager, F.3
  • 19
    • 45849140560 scopus 로고    scopus 로고
    • The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
    • [Online]. Available
    • R. Bagnara, P. M. Hill, and E. Zaffanella, "The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems," Science of Computer Programming, vol. 72, no. 1-2, pp. 3-21, 2008. [Online]. Available: http://www.cs.unipr.it/ppl/Documentation/BagnaraHZ08SCP.pdf
    • (2008) Science of Computer Programming , vol.72 , Issue.1-2 , pp. 3-21
    • Bagnara, R.1    Hill, P.M.2    Zaffanella, E.3
  • 20
    • 84974708351 scopus 로고    scopus 로고
    • Decidable model checking of probabilistic hybrid automata
    • ser. LNCS, M. Joseph, Ed. Berlin: Springer
    • J. Sproston, "Decidable model checking of probabilistic hybrid automata," in Formal Techniques in Real-Time and Faulttolerant Systems (FTRTFT), ser. LNCS, M. Joseph, Ed., vol. 1926. Berlin: Springer, 2000, pp. 31-45.
    • (2000) Formal Techniques in Real-Time and Faulttolerant Systems (FTRTFT) , vol.1926 , pp. 31-45
    • Sproston, J.1
  • 21
    • 78649463536 scopus 로고    scopus 로고
    • Synthesis and stochastic assessment of cost-optimal schedules
    • Centre for Telematics and Information Technology, University of Twente, Enschede
    • A. Mader, H. Bohnenkamp, Y. Usenko, D. Jansen, J. Hurink, and H. Hermanns, "Synthesis and stochastic assessment of cost-optimal schedules," Centre for Telematics and Information Technology, University of Twente, Enschede, Tech. Rep. TR-CTIT-06-14, 2006, http://eprints.eemcs.utwente. nl/2694/.
    • (2006) Tech. Rep. TR-CTIT-06-14
    • Mader, A.1    Bohnenkamp, H.2    Usenko, Y.3    Jansen, D.4    Hurink, J.5    Hermanns, H.6
  • 22


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