楠本研究室

業績一覧

ホーム業績一覧

Reachability Analysis of Probabilistic Timed Automata Based on an Abstraction Refinement Technique

Reachability Analysis of Probabilistic Timed Automata Based on an Abstraction Refinement Technique
Proceedings of International Workshop on Empirical Software Engineering in Practice 2010 (IWESEP 2010), pp.33-38 (2010)
タグ: abstraction, analysis, automata, probabilistic, reachability, refinement, technique, timed
@inproceedings{TakeshiNagaoka2010b,
  author = {Takeshi Nagaoka and Akihiko Ito and Toshiaki Tanaka and Kozo Okano and Shinji Kusumoto},
  title = {Reachability Analysis of Probabilistic Timed Automata Based on an Abstraction Refinement Technique},
  booktitle = {Proceedings of International Workshop on Empirical Software Engineering in Practice 2010 (IWESEP 2010)},
  pages = {33--38},
  year = {2010},
  month = {dec}
}