55 citations · 65 across the 14 of their papers we have counts for
6 papers · 1 filter
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…
Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
Uriya Bartal, Dror Fried, Jean-Marie Lagniez
Model counting () is a fundamental yet -complete problem central to probabilistic reasoning. In this work, we address \textit{incremental model counting},…
Algorithmic Aspects of Todas Theorem
Dror Fried, Etay Segal, Gad E. Yaron
Toda's Theorem is a fundamental result in computational complexity theory, whose proof is based on a reduction from a QBF problem with a constant number of quantifiers to a model c…
On Dependent Variables in Reactive Synthesis
S. Akshay, Eliyahu Basa, Supratik Chakraborty +1
Given a Linear Temporal Logic (LTL) formula over input and output variables, reactive synthesis requires us to design a deterministic Mealy machine that gives the values of outputs…
Sequential Relational Decomposition
Dror Fried, Axel Legay, Joël Ouaknine +1
The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software…
Functional Synthesis via Input-Output Separation
Supratik Chakraborty, Dror Fried, Lucas M. Tabajara +1
Boolean functional synthesis is the process of constructing a Boolean function from a Boolean specification that relates input and output variables. Despite significant recent deve…