32 citations · 38 across the 3 of their papers we have counts for
5 papers
Complexity of Verification and Synthesis of Threshold Automata
A. R. Balasubramanian, Javier Esparza, Marijana Lazic
Threshold automata are a formalism for modeling and analyzing fault-tolerant distributed algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed…
A dynamic epistemic logic analysis of the equality negation task
Eric Goubault, Marijana Lazic, Jeremy Ledent +1
In this paper we study the solvability of the equality negation task in a simple wait-free model where processes communicate by reading and writing shared variables or exchanging m…
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
Idan Berkovits, Marijana Lazic, Giuliano Losa +2
Verification of fault-tolerant distributed protocols is an immensely difficult task. Often, in these protocols, thresholds on set cardinalities are used both in the process code an…
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms
Igor Konnov, Marijana Lazic, Helmut Veith +1
Distributed algorithms have many mission-critical applications ranging from embedded systems and replicated databases to cloud computing. Due to asynchronous communication, process…
Finite generation of congruence preserving functions
Erhard Aichinger, Marijana Lazić, Nebojša Mudrinski
We investigate when the clone of congruence preserving functions is finitely generated. We obtain a full description for all finite -groups, and for all finite algebras with Mal…