Timed Comparisons of Semi-Markov Processes

Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim Guldstrand Larsen, Radu Iulian Mardare

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

1 Citationer (Scopus)
173 Downloads (Pure)


Semi-Markov processes are Markovian processes in which the firing time of transitions is modelled by probabilistic distributions over positive reals interpreted as the probability of firing a transition at a certain moment in time. In this paper we consider the trace-based semantics of semi-Markov processes, and investigate the question of how to compare two semi-Markov processes with respect to their time-dependent behaviour. To this end, we introduce the relation of being “faster than” between processes and study its algorithmic complexity. Through a connection to probabilistic automata we obtain hardness results showing in particular that this relation is undecidable. However, we present an additive approximation algorithm for a time-bounded variant of the faster-than problem over semi-Markov processes with slow residence-time functions, and a coNP algorithm for the exact faster-than problem over unambiguous semi-Markov
TitelLanguage and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings : 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings
RedaktørerCarlos Martin-Vide, Shmuel Tomi Klein, Dana Shapira
Antal sider13
ForlagSpringer Publishing Company
ISBN (Trykt)978-3-319-77312-4
ISBN (Elektronisk)978-3-319-77313-1
StatusUdgivet - 2018
BegivenhedInternational Conference on Language and Automata Theory and Applications - Ramat Gan, Israel
Varighed: 9 apr. 201811 apr. 2018


KonferenceInternational Conference on Language and Automata Theory and Applications
ByRamat Gan
NavnLecture Notes in Computer Science


Dyk ned i forskningsemnerne om 'Timed Comparisons of Semi-Markov Processes'. Sammen danner de et unikt fingeraftryk.