Guillermo A. Pérez

CoRR, 2024

Active Learning of Mealy Machines with Timers.

[BibT_eX]

[DOI]

CoRR, 2024

Synthesis of Hierarchical Controllers Based on Deep Reinforcement Learning Policies.

[BibT_eX]

[DOI]

CoRR, 2024

Continuous Pushdown VASS in One Dimension are Easy.

[BibT_eX]

[DOI]

Shrisha Rao

CoRR, 2024

Inform: From Compartmental Models to Stochastic Bounded Counter Machines.

[BibT_eX]

[DOI]

Tim Leys

CoRR, 2024

Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic.

[BibT_eX]

[DOI]

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

Integer Programming with GCD Constraints.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

The Wasserstein Believer: Learning Belief Updates for Partially Observable Environments through Reliable Latent Space Models.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

On Continuous Pushdown VASS in One Dimension.

[BibT_eX]

[DOI]

Shrisha Rao

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023

Continuous One-counter Automata.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., January, 2023

The Futures of Reactive Synthesis (Dagstuhl Seminar 23391).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2023

The Temporal Logic Synthesis Format TLSF v1.2.

[BibT_eX]

[DOI]

Swen Jacobs

Philipp Schlehuber-Caissier

CoRR, 2023

Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability.

[BibT_eX]

[DOI]

Michaël Cadilhac

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

Validating Streaming JSON Documents with Learned VPAs.

[BibT_eX]

[DOI]

Véronique Bruyère

Gaëtan Staquet

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

A Framework for the Competitive Analysis of Model Predictive Controllers.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 17th International Conference, 2023

Parikh One-Counter Automata.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

The Geometry of Reachability in Continuous Vector Addition Systems with States.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Wasserstein Auto-encoded MDPs: Formal Verification of Efficiently Distilled RL Policies with Many-sided Guarantees.

[BibT_eX]

[DOI]

Florent Delgrange

Ann Nowé

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Targeted Adversarial Attacks on Deep Reinforcement Learning Policies via Model Checking.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Agents and Artificial Intelligence, 2023

Automata with Timers.

[BibT_eX]

[DOI]

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

Graph-Based Reductions for Parametric and Weighted MDPs.

[BibT_eX]

[DOI]

Kasper Engelen

Shrisha Rao

Proceedings of the Automated Technology for Verification and Analysis, 2023

Bi-objective Lexicographic Optimization in Markov Decision Processes with Related Objectives.

[BibT_eX]

[DOI]

Damien Busatto-Gaston

Proceedings of the Automated Technology for Verification and Analysis, 2023

Formally-Sharp DAgger for MCTS: Lower-Latency Monte Carlo Tree Search using Data Aggregation with Formal Methods.

[BibT_eX]

[DOI]

Debraj Chakraborty

Damien Busatto-Gaston

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

Model Checking for Adversarial Multi-Agent Reinforcement Learning with Reactive Defense Methods.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022

Preface for the formal methods in system design special issue on SYNT 2021.

[BibT_eX]

[DOI]

Elizabeth Polgreen

Guillermo Alberto Pérez

Formal Methods Syst. Des., December, 2022

Correction to: Reactive synthesis without regret.

[BibT_eX]

[DOI]

Acta Informatica, 2022

Learning Realtime One-Counter Automata.

[BibT_eX]

[DOI]

Véronique Bruyère

Gaëtan Staquet

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

COOL-MC: A Comprehensive Tool for Reinforcement Learning and Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2022

Revisiting Parameter Synthesis for One-Counter Automata.

[BibT_eX]

[DOI]

Ritam Raha

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

Distillation of RL Policies with Formal Guarantees via Variational Abstraction of Markov Decision Processes.

[BibT_eX]

[DOI]

Florent Delgrange

Ann Nowé

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

The complexity of reachability in parametric Markov decision processes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

When are emptiness and containment decidable for probabilistic automata?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

Distillation of RL Policies with Formal Guarantees via Variational Abstraction of Markov Decision Processes (Technical Report).

[BibT_eX]

[DOI]

Florent Delgrange

Ann Nowé

CoRR, 2021

Lecture Notes on Partially Known MDPs.

[BibT_eX]

[DOI]

CoRR, 2021

Safe Learning for Near-Optimal Scheduling.

[BibT_eX]

[DOI]

Damien Busatto-Gaston

Proceedings of the Quantitative Evaluation of Systems - 18th International Conference, 2021

Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework.

[BibT_eX]

[DOI]

Floris Geerts

Filip Mazowiecki

Lisandro Zambenedetti Granville

Proceedings of the 38th International Conference on Machine Learning, 2021

Active Learning of Sequential Transducers with Side Information About the Domain.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2020

Weak Cost Register Automata are Still Powerful.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

Airtime-Based Resource Allocation Modeling for Network Slicing in IEEE 802.11 RANs.

[BibT_eX]

[DOI]

Johann M. Márquez-Barja

Steven Latré

IEEE Commun. Lett., 2020

Adversarial Patch Camouflage against Aerial Detection.

[BibT_eX]

[DOI]

Ajaya Adhikari

Richard den Hollander

CoRR, 2020

Safe Learning for Near Optimal Scheduling.

[BibT_eX]

[DOI]

CoRR, 2020

Revisiting Synthesis for One-Counter Automata.

[BibT_eX]

[DOI]

Ritam Raha

CoRR, 2020

Finite-Memory Near-Optimal Learning for Markov Decision Processes with Long-Run Average Reward.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

Coverability in 1-VASS with Disequality Tests.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

Robustness Verification for Classifier Ensembles.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2020

2019

The Extended HOA Format for Synthesis.

[BibT_eX]

[DOI]

CoRR, 2019

Partial Solvers for Generalized Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 13th International Conference, 2019

On the Complexity of Value Iteration.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

The Impatient May Use Limited Optimism to Minimize Regret.

[BibT_eX]

[DOI]

Michaël Cadilhac

Marie van den Bogaard

Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018

Mean-payoff games with partial observation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes.

[BibT_eX]

[DOI]

CoRR, 2018

Looking at mean payoff through foggy windows.

[BibT_eX]

[DOI]

Acta Informatica, 2018

When is Containment Decidable for Probabilistic Automata?.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes.

[BibT_eX]

[DOI]

Stéphane Le Roux

Proceedings of the Foundations of Software Science and Computation Structures, 2018

Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints.

[BibT_eX]

[DOI]

Jan Kretínský

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

The first reactive synthesis competition (SYNTCOMP 2014).

[BibT_eX]

[DOI]

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

The fixed initial credit problem for partial-observation energy games is Ack-complete.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

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

[BibT_eX]

[DOI]

Proceedings of the Proceedings Sixth Workshop on Synthesis, 2017

Reactive synthesis without regret.

[BibT_eX]

[DOI]

Acta Informatica, 2017

On delay and regret determinization of max-plus automata.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Reduction Techniques for Model Checking and Learning in MDPs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Optimizing Expectation with Guarantees in POMDPs.

[BibT_eX]

[DOI]

Krishnendu Chatterjee

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

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

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifth Workshop on Synthesis, 2016

Optimizing Expectation with Guarantees in POMDPs (Technical Report).

[BibT_eX]

[DOI]

Krishnendu Chatterjee

CoRR, 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

Minimizing Regret in Discounted-Sum Games.

[BibT_eX]

[DOI]

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

The fixed initial credit problem for energy games with partial-observation is Ackermann-complete.

[BibT_eX]

[DOI]

CoRR, 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

Quantitative Games under Failures.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

AbsSynthe: abstract synthesis from succinct safety specifications.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

Mean-Payoff Games with Partial-Observation - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 8th International Workshop, 2014

2013

Mean-payoff Games with Incomplete Information.

[BibT_eX]

[DOI]