Time-Abstracting Bisimulation for Markovian Timed Automata

MohammadSadegh Mohagheghi, Hojjat Sharifi
2016 International Journal of Software Engineering & Applications  
Markovian timed automata (MTA) has been proposed as an expressive formalism for specification of realtime properties in Markovian stochastic processes. In this paper, we define bisimulation relation for deterministic MTA. This definition provides a basis for developing effective algorithms for deciding bisimulation relation for such automata.
doi:10.5121/ijsea.2016.7403 fatcat:wvoxl5akivd3bpxmzjcjr3jhtq