Sciweavers

Share
FORMATS
2010
Springer

Simulation and Bisimulation for Probabilistic Timed Automata

10 years 11 months ago
Simulation and Bisimulation for Probabilistic Timed Automata
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the context of the analysis of system models, with applications in the stepwise development of systems and in model reduction. In this paper, we study probabilistic timed simulation and bisimulation relations for probabilistic timed automata. We present an EXPTIME algorithm for deciding whether two probabilistic timed automata are probabilistically timed similar or bisimilar. Furthermore, we consider a logical characterization of probabilistic timed bisimulation.
Jeremy Sproston, Angelo Troina
Added 11 Feb 2011
Updated 11 Feb 2011
Type Journal
Year 2010
Where FORMATS
Authors Jeremy Sproston, Angelo Troina
Comments (0)
books