2025
Model-checking real-time systems: revisiting the alternating automaton route.
CoRR, January, 2025
On the Probabilistic and Statistical Verification of Infinite Markov Chains (Invited Talk).
Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic, 2025
2024
Half-Positional Objectives Recognized by Deterministic Büchi Automata.
Log. Methods Comput. Sci., 2024
Beyond Decisiveness of Infinite Markov Chains.
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024
From Local to Global Optimality in Concurrent Parity Games.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024
2023
Reasoning about Quality and Fuzziness of Strategic Behaviors.
ACM Trans. Comput. Log., 2023
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs.
TheoretiCS, 2023
Arena-Independent Finite-Memory Determinacy in Stochastic Games.
Log. Methods Comput. Sci., 2023
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
CoRR, 2023
Sub-game optimal strategies in concurrent games with prefix-independent objectives.
CoRR, 2023
Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
How to Play Optimally for Regular Objectives?
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives.
Proceedings of the Foundations of Software Science and Computation Structures, 2023
2022
Games Where You Can Play Optimally with Arena-Independent Finite Memory.
Log. Methods Comput. Sci., 2022
The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk).
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next?
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2022
Finite-Memory Strategies in Two-Player Infinite Games.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022
Optimal Strategies in Concurrent Reachability Games.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022
2021
Diagnosing timed automata using timed markings.
Int. J. Softw. Tools Technol. Transf., 2021
Reconfiguration and Message Losses in Parameterized Broadcast Networks.
Log. Methods Comput. Sci., 2021
Optimal and robust controller synthesis using energy timed automata with uncertainty.
Formal Aspects Comput., 2021
From Local to Global Determinacy in Concurrent Graph Games.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021
Proceedings of the Handbook of Automata Theory., 2021
2020
Dependences in Strategy Logic.
Theory Comput. Syst., 2020
Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version).
CoRR, 2020
Taming denumerable Markov decision processes with decisiveness.
CoRR, 2020
Synthesis in Presence of Dynamic Links.
Proceedings of the Proceedings 11th International Symposium on Games, 2020
Decisiveness of Stochastic Systems and its Application to Hybrid Models.
Proceedings of the Proceedings 11th International Symposium on Games, 2020
Games Where You Can Play Optimally with Finite Memory.
CoRR, 2020
Synthesizing Safe Coalition Strategies.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020
Reasoning About Quality and Fuzziness of Strategic Behaviours.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020
CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper).
Proceedings of the 31st International Conference on Concurrency Theory, 2020
2019
On the Computation of Nash Equilibria in Games on Graphs (Invited Talk).
Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019
Nash Equilibria in Games over Graphs Equipped with a Communication Mechanism.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019
Concurrent Parameterized Games.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019
Identifiers in Registers - Describing Network Algorithms with Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2019
A Note on Game Theory and Verification.
Proceedings of the Automated Technology for Verification and Analysis, 2019
2018
Model Checking Real-Time Systems.
Proceedings of the Handbook of Model Checking., 2018
When are stochastic transition systems tameable?
J. Log. Algebraic Methods Program., 2018
Multi-weighted Markov Decision Processes with Reachability Objectives.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018
Efficient Timed Diagnosis Using Automata with Timed Domains.
Proceedings of the Runtime Verification - 18th International Conference, 2018
Games on Graphs with a Public Signal Monitoring.
Proceedings of the Foundations of Software Science and Computation Structures, 2018
Finite Bisimulations for Dynamical Systems with Overlapping Trajectories.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018
2017
Timed-automata abstraction of switched dynamical systems using control invariants.
Real Time Syst., 2017
Nash equilibria in symmetric graph games with partial observation.
Inf. Comput., 2017
Courcelle's Theorem Made Dynamic.
CoRR, 2017
Dynamic Complexity of the Dyck Reachability.
Proceedings of the Foundations of Software Science and Computation Structures, 2017
Bounding Average-Energy Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2017
On the Determinization of Timed Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017
Unbounded Product-Form Petri Nets.
Proceedings of the 28th International Conference on Concurrency Theory, 2017
Proceedings of the Models, Algorithms, Logics and Tools, 2017
2016
On the semantics of Strategy Logic.
Inf. Process. Lett., 2016
Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games.
Proceedings of the Seventh International Symposium on Games, 2016
Dynamic Complexity of Parity Games with Bounded Tree-Width.
CoRR, 2016
Optimal Reachability in Weighted Timed Automata and Games.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Stochastic Timed Games Revisited.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Reachability in Networks of Register Protocols under Stochastic Schedulers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Analysing Decisive Stochastic Processes.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Compositional Design of Stochastic Timed Automata.
Proceedings of the Computer Science - Theory and Applications, 2016
Symbolic Optimal Reachability in Weighted Timed Automata.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016
2015
Robust reachability in timed automata and games: A game-based approach.
Theor. Comput. Sci., 2015
Permissive strategies in timed automata and games.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2015
Average-energy games (full version).
CoRR, 2015
Proceedings of the Proceedings Sixth International Symposium on Games, 2015
Pure Nash Equilibria in Concurrent Deterministic Games.
Log. Methods Comput. Sci., 2015
On the optimal reachability problem in weighted timed automata and games.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015
Weighted Strategy Logic with Boolean Goals Over One-Counter Games.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015
Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015
On the Value Problem in Weighted Timed Games.
Proceedings of the 26th International Conference on Concurrency Theory, 2015
2014
Lower-bound-constrained runs in weighted timed automata.
Perform. Evaluation, 2014
Shrinking timed automata.
Inf. Comput., 2014
Nash Equilibria in Symmetric Games with Partial Observation.
Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014
Stochastic Timed Automata.
Log. Methods Comput. Sci., 2014
Mixed Nash Equilibria in Concurrent Terminal-Reward Games.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014
Quantitative Verification of Weighted Kripke Structures.
Proceedings of the Automated Technology for Verification and Analysis, 2014
2013
Robustness in Timed Automata.
Proceedings of the Reachability Problems - 7th International Workshop, 2013
Robust Weighted Timed Automata and Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013
Robust Controller Synthesis in Timed Automata.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013
2012
On termination and invariance for faulty channel machines.
Formal Aspects Comput., 2012
Almost-Sure Model-Checking of Reactive Timed Automata.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012
Robust Reachability in Timed Automata: A Game-Based Approach.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Concurrent Games with Ordered Objectives.
Proceedings of the Foundations of Software Science and Computational Structures, 2012
2011
Timed Modal Logics for Real-Time Systems - Specification, Verification and Control.
J. Log. Lang. Inf., 2011
Quantitative analysis of real-time systems using priced timed automata.
Commun. ACM, 2011
Emptiness and Universality Problems in Timed Automata with Positive Frequency.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
Nash Equilibria in Concurrent Games with Büchi Objectives.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011
Robust Model-Checking of Timed Automata via Pumping in Channel Machines.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011
Timed Automata Can Always Be Made Implementable.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited.
Proceedings of the Automated Technology for Verification and Analysis, 2011
2010
On the expressiveness of TPTL and MTL.
Inf. Comput., 2010
O-Minimal Hybrid Reachability Games
Log. Methods Comput. Sci., 2010
Timed automata with observers under energy constraints.
Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, 2010
Computing Rational Radical Sums in Uniform TC^0.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010
Computing Equilibria in Two-Player Timed Games <i>via</i> Turn-Based Finite Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010
Nash Equilibria for Reachability Objectives in Multi-player Timed Games.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010
2009
Undecidability Results for Timed Automata with Silent Transitions.
Fundam. Informaticae, 2009
Weighted o-minimal hybrid systems.
Ann. Pure Appl. Log., 2009
Reachability in Stochastic Timed Games.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009
When Are Timed Automata Determinizable?
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009
Measuring Permissivity in Finite Games.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009
2008
Model Checking One-Clock Priced Timed Automata.
Log. Methods Comput. Sci., 2008
Timed Petri nets and timed automata: On the discriminating power of zeno sequences.
Inf. Comput., 2008
Optimal infinite scheduling for multi-priced timed automata.
Formal Methods Syst. Des., 2008
On Termination for Faulty Channel Machines.
Proceedings of the STACS 2008, 2008
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008
On Expressiveness and Complexity in Real-Time Model Checking.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Robust Analysis of Timed Automata via Channel Machines.
Proceedings of the Foundations of Software Science and Computational Structures, 2008
Infinite Runs in Weighted Timed Automata with Energy Constraints.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008
2007
On the optimal reachability problem of weighted timed automata.
Formal Methods Syst. Des., 2007
Model-checking Timed Temporal Logics.
Proceedings of the 5th Workshop on Methods for Modalities, 2007
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007
Probabilistic and Topological Semantics for Timed Automata.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007
2006
Lower and upper bounds in zone-based abstractions of timed automata.
Int. J. Softw. Tools Technol. Transf., 2006
Improved undecidability results on weighted timed automata.
Inf. Process. Lett., 2006
Weighted Timed Automata: Model-Checking and Games.
Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006
On the Control of Timed and Hybrid Systems.
Bull. EATCS, 2006
Control in o-minimal Hybrid Systems.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006
Robust Model-Checking of Linear-Time Properties in Timed Automata.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
Almost Optimal Strategies in One Clock Priced Timed Games.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006
Controller Synthesis for MTL Specifications.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006
Timed Temporal Logics for Abstracting Transient States.
Proceedings of the Automated Technology for Verification and Analysis, 2006
Timed Unfoldings for Networks of Timed Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2006
Extended Timed Automata and Time Petri Nets.
Proceedings of the Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 2006
2005
On Conciseness of Extensions of Timed Automata.
J. Autom. Lang. Comb., 2005
Fault Diagnosis Using Timed Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2005
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005
A New Modality for Almost Everywhere Properties in Timed Automata.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005
Modal Logics for Timed Control.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005
2004
Updatable timed automata.
Theor. Comput. Sci., 2004
Forward Analysis of Updatable Timed Automata.
Formal Methods Syst. Des., 2004
Synthesis of Optimal Strategies Using HyTech.
Proceedings of the Workshop on Games in Design and Verification, 2004
Staying Alive as Cheaply as Possible.
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004
Optimal Strategies in Priced Timed Game Automata.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004
2003
The power of reachability testing for timed automata.
Theor. Comput. Sci., 2003
An algebraic approach to data languages and timed languages.
Inf. Comput., 2003
Static Guard Analysis in Timed Automata Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003
Untameable Timed Automata!
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Timed Control with Partial Observability.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003
2002
A Kleene/Büchi-like Theorem for Clock Languages.
J. Autom. Lang. Comb., 2002
A logical characterization of data languages.
Inf. Process. Lett., 2002
2001
An Algebraic Characterization of Data and Timed Languages.
Proceedings of the CONCUR 2001, 2001
2000
Expressiveness of Updatable Timed Automata.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
Are Timed Automata Updatable?
Proceedings of the Computer Aided Verification, 12th International Conference, 2000
1999
Decomposition and Composition of Timed Automata.
Proceedings of the Automata, 1999