19 citations · 20 across the 6 of their papers we have counts for
8 papers
Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
Daniel Stan, Adrien Pommellet, Juliette Jacquot
Active automata learning (AAL) under a Minimally Adequate Teacher (MAT) has been successfully used to infer a regular language through membership and equivalence queries. This lang…
Active Learning Techniques for Pomset Recognizers
Adrien Pommellet, Amazigh Amrane, Edgar Delaporte +2
Pomsets are a promising formalism for concurrent programs based on partially ordered sets. Among this class, series-parallel pomsets admit a convenient linear representation and ca…
SAT-based Learning of Computation Tree Logic
Adrien Pommellet, Daniel Stan, Simon Scatton
The CTL learning problem consists in finding for a given sample of positive and negative Kripke structures a distinguishing CTL formula that is verified by the former but not by th…
Effective Reductions of Mealy Machines
Florian Renkin, Philipp Schlehuber-Caissier, Alexandre Duret-Lutz +1
We revisit the problem of reducing incompletely specified Mealy machines with reactive synthesis in mind. We propose two techniques: the former is inspired by the tool MeMin and so…
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021
Swen Jacobs, Guillermo A. Perez, Remco Abraham +22
We report on the last four editions of the reactive synthesis competition (SYNTCOMP 2018-2021). We briefly describe the evaluation scheme and the experimental setup of SYNTCOMP. Th…
Improvements to ltlsynt
Florian Renkin, Philipp Schlehuber, Alexandre Duret-Lutz +1
ltlsynt is a tool for LTL reactive synthesis. We summarize its evolution since 2018.
Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-vous
Adrien Pommellet, Tayssir Touili
We present in this paper a generic framework for the analysis of multi-threaded programs with recursive procedure calls, synchronisation by rendez-vous between parallel threads, an…
Reachability Analysis of Pushdown Systems with an Upper Stack
Adrien Pommellet, Marcio Diaz, Tayssir Touili
Pushdown systems (PDSs) are a natural model for sequential programs, but they can fail to accurately represent the way an assembly stack actually operates. Indeed, one may want to…