activity
20082023
most citedStochastic Timed Automata

52 citations · 269 across the 38 of their papers we have counts for

collaborators
Showing 2017Show all

6 papers · 1 filter

cs.GT2017★ 2 cited

Games on graphs with a public signal monitoring

Patricia Bouyer

We study pure Nash equilibria in games on graphs with an imperfect monitoring based on a public signal. In such games, deviations and players responsible for those deviations can b…

cs.GT2017

Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification

Patricia Bouyer, Andrea Orlandini, Pierluigi San Pietro

This volume contains the proceedings of the Eighth International Symposium on Games, Automata, Logic and Formal Verification (GandALF 2017). The symposium took place in Roma, Italy…

cs.LO2017

Dependences in Strategy Logic

Patrick Gardy, Patricia Bouyer, Nicolas Markey

Strategy Logic (SL) is a very expressive logic for specifying and verifying properties of multi-agent systems: in SL, one can quantify over strategies, assign them to agents, and e…

cs.PF2017

Unbounded product-form Petri nets

Patricia Bouyer, Serge Haddad, Vincent Jugé

Computing steady-state distributions in infinite-state stochastic systems is in general a very dificult task. Product-form Petri nets are those Petri nets for which the steady-stat…

cs.LO2017

When are Stochastic Transition Systems Tameable?

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye +1

A decade ago, Abdulla, Ben Henda and Mayr introduced the elegant concept of decisiveness for denumerable Markov chains [1]. Roughly speaking, decisiveness allows one to lift most g…

cs.CC2017★ 1 cited

Courcelle's Theorem Made Dynamic

Patricia Bouyer-Decitre, Vincent Jugé, Nicolas Markey

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-o…