12 citations · 41 across the 8 of their papers we have counts for
8 papers · 1 filter
Conformance Relations and Hyperproperties for Doping Detection in Time and Space
Sebastian Biewer, Rayna Dimitrova, Michael Fries +4
We present a novel and generalised notion of doping cleanness for cyber-physical systems that allows for perturbing the inputs and observing the perturbed outputs both in the time-…
Distinguishing between Communicating Transactions
Vasileios Koutavas, Maciej Gazda, Matthew Hennessy
Communicating transactions is a form of distributed, non-isolated transactions which provides a simple construct for building concurrent systems. In this paper we develop a logical…
Improvement in Small Progress Measures
Maciej Gazda, Tim A. C. Willemse
Small Progress Measures is one of the classical parity game solving algorithms. For games with n vertices, m edges and d different priorities, the original algorithm computes the w…
Strategy Derivation for Small Progress Measures
Maciej Gazda, Tim A. C. Willemse
Small Progress Measures is one of the most efficient parity game solving algorithms. The original algorithm provides the full solution (winning regions and strategies) in $O(dm \cd…
Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds
Maciej Gazda, Tim A. C. Willemse
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes…
Expressiveness and Completeness in Abstraction
Maciej Gazda, Tim A. C. Willemse
We study two notions of expressiveness, which have appeared in abstraction theory for model checking, and find them incomparable in general. In particular, we show that according t…