%0 Conference Paper
%A Pham, Dinh Chinh
%A Miaomiao, Zhang
%A Dang, Van Hung
%B SW4PHD: the 2016 Scientific Workshop for PhD Students
%C Hanoi
%D 2016
%F SisLab:1541
%T On Model-Checking Probabilistic Timed Automata against Probabilistic Duration Properties
%U https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1541/
%X 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.