Abstract
Equivalence relations are widely used for comparing the behavior of stochastic systems. This paper introduces several variants of trace equivalence for continuous-time Markov decision processes (CTMDPs). These trace equivalences are obtained as a result of button pushing experiments with a black box model of CTMDP. For every class of CTMDP scheduler, a corresponding variant of trace equivalence has been introduced. We investigate the relationship among these trace equivalences and also compare them with bisimulation for CTMDPs. Finally, we prove that the properties specified using deterministic timed automaton (DTA) specifications and metric temporal logic (MTL) formulas are preserved under some of these trace equivalences.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
