TY  - CONF
ID  - SisLab1541
UR  - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1541/
A1  - Pham, Dinh Chinh
A1  - Miaomiao, Zhang
A1  - Dang, Van Hung
Y1  - 2016/03/26/
N2  - 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.
TI  - On Model-Checking Probabilistic Timed Automata against Probabilistic Duration Properties
M2  - Hanoi
AV  - public
T2  - SW4PHD: the 2016 Scientific Workshop for PhD Students
ER  -