activity
20132026
most citedConformance Relations and Hyperproperties for Doping Detection in Time and Space

12 citations · 43 across the 22 of their papers we have counts for

collaborators

24 papers

cs.LO2026★ 1 cited

Modular Attractor Acceleration in Infinite-State Games (Full Version)

Philippe Heim, Rayna Dimitrova

Infinite-state games provide a framework for the synthesis of reactive systems with unbounded data domains. Solving such games typically relies on computing symbolic fixpoints, par…

cs.MA2025

Synthesis of Communication Policies for Multi-Agent Systems Robust to Communication Restrictions

Saleh Soudijani, Rayna Dimitrova

We study stochastic multi-agent systems in which agents must cooperate to maximize the probability of achieving a common reach-avoid objective. In many applications, during the exe…

cs.LO2025★ 2 cited

Issy: A Comprehensive Tool for Specification and Synthesis of Infinite-State Reactive Systems

Philippe Heim, Rayna Dimitrova

The synthesis of infinite-state reactive systems from temporal logic specifications or infinite-state games has attracted significant attention in recent years, leading to the emer…

cs.LO2024

Contract-based Design and Verification of Multi-Agent Systems with Quantitative Temporal Requirements

Rafael Dewes, Rayna Dimitrova

Quantitative requirements play an important role in the context of multi-agent systems, where there is often a trade-off between the tasks of individual agents and the constraints…

cs.LO2024

Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis (Full Version)

Philippe Heim, Rayna Dimitrova

Infinite-state reactive synthesis has attracted significant attention in recent years, which has led to the emergence of novel symbolic techniques for solving infinite-state games.…

cs.LO2024★ 1 cited

Localized Attractor Computations for Infinite-State Games (Full Version)

Anne-Kathrin Schmuck, Philippe Heim, Rayna Dimitrova +1

Infinite-state games are a commonly used model for the synthesis of reactive systems with unbounded data domains. Symbolic methods for solving such games need to be able to constru…