Transforming Probabilistic Timed Automata to PRISM Model

Abstract

The probabilistic timed automata are the models used to represent the probabilistic and time characteristics of systems to analyze the behavior of the system, including communication and multimedia. PRISM is a probabilistic model checker, a tool for formal modeling and probabilistic behavior analysis of systems. The PRISM language is used to construct the probabilistic timed automata to analyze and verify systems with PRISM. This paper proposes a set of probabilistic timed automata transform rules for transforming XML elements that represent probabilistic timed automata to PRISM model. The result can be used to analyze probabilistically and verify complex properties by the PRISM Model Checker.