%A Dinh Chinh Pham
%A Zhang Miaomiao
%A Van Hung Dang
%T On Model-Checking Probabilistic Timed Automata against Probabilistic Duration Properties
%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.
%C Hanoi
%D 2016
%L SisLab1541