Timed comparisons of semi-Markov processes

Prelegent(ci)

Nathanael Fijalkow

Afiliacja

University College London

Termin

18 października 2017 14:15

Pokój

p. 5050

Seminarium

Seminarium „Teoria automatów”

---

A semi-Markov process is like a Markov process, but each transition takes some time to get fired, and this time is determined by a probabilistic distribution over the non-negative reals.
In this talk I will discuss algorithms for determining whether a semi-Markov process is faster than another, or whether two semi-Markov processes are equally fast.
Joint work with Mathias R. Pederson from Aalborg.

---