#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2008

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Josée Desharnais, François Laviolette, Mathieu Tracol
- 2008 Fifth International Conference on…
- 2008

We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities because these often come… (More)

- Mathieu Tracol, Josée Desharnais, Abir Zhioua
- QAPL
- 2011

We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error ε . When ε = 0 we retrieve the usual notions of bisimulation and simulation on PAs. We… (More)

- Julien Vallet, F. Panissod, Christoph Strecha, Mathieu Tracol
- 2011

Low cost mapping using UAV technology is becoming a trendy topic. Many systems exist where a simple camera can be deployed to take images, generally georeferenced with a GPS chip and MEMS attitude… (More)

- Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol
- J. Comput. Syst. Sci.
- 2016

We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages extends regular languages to infinite… (More)

- Mathieu Tracol, Christel Baier, Marcus Größer
- FSTTCS
- 2009

In a context of ω-regular specifications for infinite execution sequences, the classical Büchi condition, or repeated liveness condition, asks that an accepting state is visited infinitely often. In… (More)

- Krishnendu Chatterjee, Mathieu Tracol
- 2012 27th Annual IEEE Symposium on Logic in…
- 2012

We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether… (More)

We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The qualitative analysis problem given a POMDP and a parity objective… (More)

- Michel de Rougemont, Mathieu Tracol
- 2009 24th Annual IEEE Symposium on Logic In…
- 2009

We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence problems. The… (More)

- Mathieu Tracol
- Oper. Res. Lett.
- 2009

- Mathieu Tracol
- Theor. Comput. Sci.
- 2011

A Finite Probabilistic Table, or FPT, consists of a finite state space S, an initial distribution on S, and a finite set of Markov matrices on S, labeled by an alphabet Σ . An infinite word on Σ… (More)