Dinh Chinh Pham and Zhang Miaomiao and Van Hung Dang (2016) On Model-Checking Probabilistic Timed Automata against Probabilistic Duration Properties. In: SW4PHD: the 2016 Scientific Workshop for PhD Students, 26 March 2016, Hanoi.
In this paper, we consider a subclass of Probabilistic Duration Cal- culus formula called Simple Probabilistic Duration Calculus (SPDC) as a language for specifying dependability requirements for real-time systems, and address the two problems: to decide if a probabilistic timed automaton satisfies a SPDC formula, and to decide if there is a strategy to choose an execution of a given automaton that satisfies a SPDC formula. We prove that the both problems are decidable for a class of SPDC called probabilistic linear duration invariants, and provide a model checking algorithm for solving these problems.
|Item Type:||Conference or Workshop Item (Poster)|
|Subjects:||Information Technology (IT)|
|Divisions:||Faculty of Information Technology (FIT)|
|Deposited By:||Dr Ngoc Thang Bui|
|Deposited On:||23 May 2016 03:20|
|Last Modified:||23 May 2016 03:23|
Repository Staff Only: item control page