most citedFast Obligation Translation and Synthesis

1 citations · 1 across the 5 of their papers we have counts for

collaborators

6 papers

cs.RO2026

Explaining Failures of Cyber-Physical Systems with Actual Causality

Khen Elimelech, Tom Yaacov, David A. Kelly +2

Modern autonomous Cyber-Physical Systems (CPSs), such as self-driving cars, face increasingly complex demands, and yet are expected to act reliably. The black-box nature often char…

cs.LO2026

Understanding CDCL Solvers via Scalability Studies and Proofdoors

Shimin Zhang, Yechuan Xia, Chunxiao Li +3

Over the past several decades, CDCL SAT solvers have proven remarkably effective on large industrial formulas, despite SAT being NP-complete and widely believed to be intractable.…

cs.FL20261 cited

Fast Obligation Translation and Synthesis

Alexandre Duret-Lutz, Giuseppe De Giacomo, Marcin Jurdzinski +3

Syntactic obligations are a fragment of LTL formulas that translate to deterministic weak -automata (DWA). We show that syntactic obligations can be very efficiently converted…

cs.LO2026

On-the-fly LTLf Synthesis under Partial Observability

Nadav Alon, Supratik Chakraborty, Alexandre Duret-Lutz +4

LTLf synthesis under partial observability requires reasoning about unobservable environment variables, which is typically handled by constructing a belief-state DFA via subset con…

cs.GT2026

Verification of Correlated Equilibria in Concurrent Reachability Games

Senthil Rajasekaran, Jean-François Raskin, Moshe Y. Vardi

As part of an effort to apply the rigorous guarantees of formal verification to multi-agent systems, the field of equilibrium analysis, also called rational verification, studies e…

cs.AI2026

Incremental LTLf Synthesis

Giuseppe De Giacomo, Yves Lespérance, Gianmarco Parretti +2

In this paper, we study incremental LTLf synthesis -- a form of reactive synthesis where the goals are given incrementally while in execution. In other words, the protagonist agent…