Amélie Stainer
Title
Cited by
Cited by
Year
Off-line test selection with test purposes for non-deterministic timed automata
ASMK Nathalie Bertrand, Thierry Jéron
Logical methods in computer science 8 (4), 1-33, 2012
48*2012
Monitor-based statistical model checking for weighted metric temporal logic
P Bulychev, A David, KG Larsen, A Legay, G Li, DB Poulsen, A Stainer
International Conference on Logic for Programming Artificial Intelligence …, 2012
392012
A game approach to determinize timed automata
N Bertrand, A Stainer, T Jéron, M Krichen
International Conference on Foundations of Software Science and …, 2011
362011
Off-line test selection with test purposes for non-deterministic timed automata
N Bertrand, T Jéron, A Stainer, M Krichen
International Conference on Tools and Algorithms for the Construction and …, 2011
342011
A game approach to determinize timed automata
N Bertrand, A Stainer, T Jéron, M Krichen
Formal Methods in System Design 46 (1), 42-80, 2015
212015
Reachability of communicating timed processes
L Clemente, F Herbreteau, A Stainer, G Sutre
International Conference on Foundations of Software Science and …, 2013
212013
Frequencies in forgetful timed automata
A Stainer
International Conference on Formal Modeling and Analysis of Timed Systems …, 2012
82012
Emptiness and universality problems in timed automata with positive frequency
N Bertrand, P Bouyer, T Brihaye, A Stainer
International Colloquium on Automata, Languages, and Programming, 246-257, 2011
52011
Test d'automates temporisées
A Stainer
équipe VerTeCs, INRIA. Master en informatique à Rennes 1, 2010
42010
Synthesising succinct strategies in safety and reachability games
G Geeraerts, J Goossens, A Stainer
International Workshop on Reachability Problems, 98-111, 2014
32014
Synthesising succinct strategies in safety games with an application to real-time scheduling
G Geeraerts, J Goossens, A Stainer
Theoretical Computer Science 735, 24-49, 2018
22018
Contribution to the Verification of Timed Automata: Determinization, Quantitative Verification and Reachability in Networks of Automata
A Stainer
22013
Deliverable L1: State of the art and selected references
L Hélouët, E Fabre, C Morvan, B Genest, K Kecir, H Marchand
2014
Efficient computation of succinct strategies, with applications to real-time scheduler synthesis⋆
G Geeraerts, J Goossens, A Stainer
2014
Contribution à la vérification d'automates temporisés: déterminisation, vérification quantitative et accessibilité dans les réseaux d'automates
A Stainer
Rennes 1, 2013
2013
The system can't perform the operation now. Try again later.
Articles 1–15