Ocan Sankur

Theor. Comput. Sci., 2023

Games on Graphs.

[BibT_eX]

[DOI]

Nathanaël Fijalkow

Nathalie Bertrand

Patricia Bouyer-Decitre

CoRR, 2023

PyLTA: A Verification Tool for Parameterized Distributed Algorithms.

[BibT_eX]

[DOI]

Bastien Thomas

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Timed Automata Verification and Synthesis via Finite Automata Learning.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Isseïnie Calviac

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Contributions on Formal Methods for Timed and Probabilistic Systems.

[BibT_eX]

[DOI]

, 2023

2022

The Variance-Penalized Stochastic Shortest Path Problem.

[BibT_eX]

[DOI]

Jakob Piribauer

Christel Baier

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Parameterized Safety Verification of Round-Based Shared-Memory Systems.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Semilinear Representations for Series-Parallel Atomic Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Non-blind Strategies in Timed Network Congestion Games.

[BibT_eX]

[DOI]

Aline Goeminne

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2022

Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next?

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2022

Repairing Real-Time Requirements.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2022

2021

Connect Multi-Agent Path Finding: Generation and Visualization.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Compositional model checking of an SDN platform.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on the Design of Reliable Communication Networks, 2021

Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Planning for Connected Agents in a Partially Known Environment.

[BibT_eX]

[DOI]

Proceedings of the 34th Canadian Conference on Artificial Intelligence, 2021

2020

Conflict-Based Search for Connected Multi-Agent Path Finding.

[BibT_eX]

[DOI]

CoRR, 2020

Complexity of planning for connected agents.

[BibT_eX]

[DOI]

Tristan Charrier

Auton. Agents Multi Agent Syst., 2020

Dynamic Network Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Incremental Methods for Checking Real-Time Consistency.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2020

2019

Reachability and Coverage Planning for Connected Agents: Extended Version.

[BibT_eX]

[DOI]

Tristan Charrier

CoRR, 2019

Performance Evaluation of Metro Regulations Using Probabilistic Model-Checking.

[BibT_eX]

[DOI]

Proceedings of the Reliability, Safety, and Security of Railway Systems. Modelling, Analysis, Verification, and Certification, 2019

Long-run Satisfaction of Path Properties.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Reachability and Coverage Planning for Connected Agents.

[BibT_eX]

[DOI]

Tristan Charrier

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Abstraction Refinement Algorithms for Timed Automata.

[BibT_eX]

[DOI]

Victor Roussanaly

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach.

[BibT_eX]

[DOI]

Damien Busatto-Gaston

Benjamin Monmege

Pierre-Alain Reynier

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018

Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

The first reactive synthesis competition (SYNTCOMP 2014).

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2017

Percentile queries in multi-dimensional Markov decision processes.

[BibT_eX]

[DOI]

Mickael Randour

Formal Methods Syst. Des., 2017

The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Sixth Workshop on Synthesis, 2017

Admissibility in Concurrent Games.

[BibT_eX]

[DOI]

CoRR, 2017

Assume-admissible synthesis.

[BibT_eX]

[DOI]

Romain Brenguier

Acta Informatica, 2017

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP.

[BibT_eX]

[DOI]

Jean-Pierre Talpin

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Admissiblity in Concurrent Games.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Admissibility in Games with Imperfect Information (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Concurrency Theory, 2017

Admissible Strategies in Timed Games.

[BibT_eX]

[DOI]

Nicolas Basset

Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016

The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifth Workshop on Synthesis, 2016

Non-Zero Sum Games for Reactive Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2016

Admissibility in Quantitative Graph Games.

[BibT_eX]

[DOI]

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Robust reachability in timed automata and games: A game-based approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The Second Reactive Synthesis Competition (SYNTCOMP 2015).

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fourth Workshop on Synthesis, 2015

Compositional Algorithms for Succinct Safety Games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fourth Workshop on Synthesis, 2015

Variations on the Stochastic Shortest Path Problem.

[BibT_eX]

[DOI]

Mickael Randour

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

Symbolic Quantitative Robustness Analysis of Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

2014

Shrinking timed automata.

[BibT_eX]

[DOI]

Inf. Comput., 2014

AbsSynthe: abstract synthesis from succinct safety specifications.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

Multiple-Environment Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Probabilistic Robust Timed Games.

[BibT_eX]

[DOI]

Youssouf Oualhadj

Pierre-Alain Reynier

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013

Robustness in timed automata : analysis, synthesis, implementation. (Robustesse dans les automates temporisés : analyse, synthèse, implémentation).

[BibT_eX]

[DOI]

PhD thesis, 2013

Robustness in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 7th International Workshop, 2013

Robust Weighted Timed Automata and Games.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

Robust Controller Synthesis in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Shrinktech: A Tool for the Robustness Analysis of Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

Robust Reachability in Timed Automata: A Game-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

A Comparison of Succinctly Represented Finite-State Systems.

[BibT_eX]

[DOI]

Romain Brenguier

Stefan Göller

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011

Untimed Language Preservation in Timed Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Robust Model-Checking of Timed Automata via Pumping in Channel Machines.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Timed Automata Can Always Be Made Implementable.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

Online Correlation Clustering.

[BibT_eX]

[DOI]

Claire Mathieu