40.2k citations
- Max Planck SocietyDE68 papers
- University of OxfordGB25 papers
- Centre National de la Recherche ScientifiqueFR24 papers
- Saarland UniversityDE17 papers
- University of CambridgeGB12 papers
- ETH ZurichCH11 papers
- IMDEA Software InstituteES10 papers
- Indian Institute of Technology KharagpurIN10 papers
- University of California, Los AngelesUS10 papers
- Max Planck Institute for InformaticsDE9 papers
- National University of SingaporeSG9 papers
- Newcastle UniversityGB9 papers
4 papers · 2 filters
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
S. Akshay, Hugo Bazille, Blaise Genest +1
The Skolem problem is a long-standing open problem in linear dynamical systems: can a linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly, t…
Existential Definability over the Subword Ordering
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam +1
We study first-order logic (FO) over the structure consisting of finite words over some alphabet , together with the (non-contiguous) subword ordering. In terms of decidability…
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
Satya Prakash Nayak, Daniel Neider, Martin Zimmermann
While most of the current synthesis algorithms only focus on correctness-by-construction, ensuring robustness has remained a challenge. Hence, in this paper, we address the robust-…
Robust Computation Tree Logic
Satya Prakash Nayak, Daniel Neider, Rajarshi Roy +1
It is widely accepted that every system should be robust in that ``small'' violations of environment assumptions should lead to ``small'' violations of system guarantees, but it is…