Reachability Analysis for Probabilistic Timed System based on Timed Abstraction Refinement Technique

HANDLE Web Site 7 References Open Access

Bibliographic Information

Other Title
  • 時間抽象を行う洗練手法を用いた確率時間システムの到達可能性解析
  • ジカン　チュウショウ　ヲ　オコナウ　センレン　シュホウ　ヲ　モチイタ　カクリツ　ジカン　システム　ノ　トウタツ　カノウセイ　カイセキ

Search this article

Abstract

This paper gives a reachability analysis technique for Probabilistic Timed Automaton (PTA), based on CEGAR loop. The proposed method uses a transformation technique in order to avoid influence caused by dynamic change of behaviour with elapsing time.

Journal

References(7)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top