Development of Verifier of Strong Probabilistic Timed Simulation for Probabilistic Timed Automata

Abstract

In 2003, we have defined a strong probabilistic timed simulation relation of probabilistic timed automata, which is given by the combination of a strong timed simulation relation and a probabilistic simulation relation. Also, we have shown that a strong probabilistic timed simulation relation of probabilistic timed automata is decidable. But we didn't give the algorithm. In this paper, we propose a concrete algorithm M and implement the algorithm. As the verification cost of real-time systems is very high, we propose the following algorithm: In the algorithm M, counter examples such as pairs of states, which do not satisfy the conditions of a strong probabilistic timed simulation relation, are gradually removed from the initial set, and finally judge whether one probabilistic timed automaton simulates another or not.