Mouhammad Sakr
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mouhammad Sakr has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Swen Jacobs
CISPA Helmholtz Center for Information Security
8 shared publications - Marcus Völp
Luxembourg University
5 shared publications - Tom Baumeister
CISPA Helmholtz Center for Information Security
4 shared publications - Paul Eichler
CISPA Helmholtz Center for Information Security
2 shared publications - Kinan Dak Albab
Boston University, Boston, Massachusetts, USA
1 shared publication Mahboubeh Kalateh Dowlati
Luxembourg University
1 shared publication
Latest Publications
- Open Access
- 24 July 2026
- Published by Springer Nature
- p. 403-417
TACO: A Toolsuite for the Verification of Threshold Automata
We present Taco , a toolsuite for the development and automatic verification of fault-tolerant and threshold-based distributed algorithms. Our toolsuite implements three approaches for model checking threshold automata in different decidable fragments known from the literature and two semi-decision procedures going beyond these decidable fragments. Moreover, Taco is a modular, extensible, and well-documented framework for developing algorithms and tools for threshold automata. We present important features, give an overview of the implemented algorithms, and evaluate their performance experimentally.
- 24 July 2026
- Published by Springer Nature
- p. 403-417
Open AccessTACO: A Toolsuite for the Verification of Threshold Automata
We present Taco , a toolsuite for the development and automatic verification of fault-tolerant and threshold-based distributed algorithms. Our toolsuite implements three approaches for model checking threshold automata in different decidable fragments known from the literature and two semi-decision procedures going beyond these decidable fragments. Moreover, Taco is a modular, extensible, and well-documented framework for developing algorithms and tools for threshold automata. We present important features, give an overview of the implemented algorithms, and evaluate their performance experimentally.
- Open Access
- 30 August 2025
- Published by Springer Nature
- p. 408-424
Termination in Extended Probabilistic Threshold Automata
- 30 August 2025
- Published by Springer Nature
- p. 408-424
Open AccessTermination in Extended Probabilistic Threshold Automata
- Open Access
- 18 April 2025
- Published by Springer Nature in Formal Methods in System Design
- Vol. 66 (3) , 335-375
Automatic WSTS-based repair and deadlock detection of parameterized systems
We present an algorithm for the repair of parameterized systems that can be represented as well-structured transition systems. The repair problem is, for a given process implementation, to find a refinement such that a given safety property is satisfied by the resulting parameterized system, and deadlocks are avoided. Our algorithm uses a parameterized model checker to determine the correctness of candidate solutions and employs a constraint system to rule out candidates. Parameterized systems that fall into our class include disjunctive systems, pairwise rendezvous systems, broadcast protocols, and certain global synchronization protocols. Moreover, we show that parameterized deadlock detection and similar global properties can be decided in EXPTIME for disjunctive systems, and that deadlock detection is in general undecidable for broadcast protocols.
- 18 April 2025
- Published by Springer Nature in Formal Methods in System Design
- Vol. 66 (3) , 335-375
Open AccessAutomatic WSTS-based repair and deadlock detection of parameterized systems
We present an algorithm for the repair of parameterized systems that can be represented as well-structured transition systems. The repair problem is, for a given process implementation, to find a refinement such that a given safety property is satisfied by the resulting parameterized system, and deadlocks are avoided. Our algorithm uses a parameterized model checker to determine the correctness of candidate solutions and employs a constraint system to rule out candidates. Parameterized systems that fall into our class include disjunctive systems, pairwise rendezvous systems, broadcast protocols, and certain global synchronization protocols. Moreover, we show that parameterized deadlock detection and similar global properties can be decided in EXPTIME for disjunctive systems, and that deadlock detection is in general undecidable for broadcast protocols.
- Open Access
- 11 September 2024
- Published by Springer Nature
- p. 638-657
Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold Automata
Threshold automata are a computational model that has proven to be versatile in modeling threshold-based distributed algorithms and enabling their completely automatic parameterized verification. We present novel techniques for the verification of threshold automata, based on well-structured transition systems, that allow us to extend the expressiveness of both the computational model and the specifications that can be verified. In particular, we extend the model to allow decrements and resets of shared variables, possibly on cycles, and the specifications to general coverability. While these extensions of the model in general lead to undecidability, our algorithms provide a semi-decision procedure. We demonstrate the benefit of our extensions by showing that we can model complex round-based algorithms such as the phase king consensus algorithm and the Red Belly Blockchain protocol (published in 2019), and verify them fully automatically for the first time.
- 11 September 2024
- Published by Springer Nature
- p. 638-657
Open AccessParameterized Verification of Round-Based Distributed Algorithms via Extended Threshold Automata
Threshold automata are a computational model that has proven to be versatile in modeling threshold-based distributed algorithms and enabling their completely automatic parameterized verification. We present novel techniques for the verification of threshold automata, based on well-structured transition systems, that allow us to extend the expressiveness of both the computational model and the specifications that can be verified. In particular, we extend the model to allow decrements and resets of shared variables, possibly on cycles, and the specifications to general coverability. While these extensions of the model in general lead to undecidability, our algorithms provide a semi-decision procedure. We demonstrate the benefit of our extensions by showing that we can model complex round-based algorithms such as the phase king consensus algorithm and the Red Belly Blockchain protocol (published in 2019), and verify them fully automatically for the first time.
- Open Access
- 22 July 2024
- Published by Springer Nature in Research Square
Automatic WSTS-based Repair and Deadlock Detection of Parameterized Systems
We present an algorithm for the repair of parameterized systems that can be represented as well-structured transition systems. The repair problem is, for a given process implementation, to find a refinement such that a given safety property is satisfied by the resulting parameterized system,and deadlocks are avoided. Our algorithm uses a parameterized model checker to determine the correctness of candidate solutions and employs a constraint system to rule out candidates. Parameterized systems that fall into our class include disjunctive systems, pairwise rendezvous systems, broadcast protocols, and certain global synchronization protocols. Moreover, we show that parameterized deadlock detection and similar global properties can be decided in EXPTIME for disjunctive systems, and that deadlock detection is in general undecidable for broadcast protocols.
- 22 July 2024
- Published by Springer Nature in Research Square
Open AccessAutomatic WSTS-based Repair and Deadlock Detection of Parameterized Systems
We present an algorithm for the repair of parameterized systems that can be represented as well-structured transition systems. The repair problem is, for a given process implementation, to find a refinement such that a given safety property is satisfied by the resulting parameterized system,and deadlocks are avoided. Our algorithm uses a parameterized model checker to determine the correctness of candidate solutions and employs a constraint system to rule out candidates. Parameterized systems that fall into our class include disjunctive systems, pairwise rendezvous systems, broadcast protocols, and certain global synchronization protocols. Moreover, we show that parameterized deadlock detection and similar global properties can be decided in EXPTIME for disjunctive systems, and that deadlock detection is in general undecidable for broadcast protocols.
- Open Access
- 15 July 2021
- Published by Springer Nature
- p. 435-446
AIGEN: Random Generation of Symbolic Transition Systems
AIGEN is an open source tool for the generation of transition systems in a symbolic representation. To ensure diversity, it employs a uniform random sampling over the space of all Boolean functions with a given number of variables. AIGEN relies on reduced ordered binary decision diagrams (ROBDDs) and canonical disjunctive normal form (CDNF) as canonical representations that allow us to enumerate Boolean functions, in the former case with an encoding that is inspired by data structures used to implement ROBDDs. Several parameters allow the user to restrict generation to Boolean functions or transition systems with certain properties, which are then output in AIGER format. We report on the use of AIGEN to generate random benchmark problems for the reactive synthesis competition SYNTCOMP 2019, and present a comparison of the two encodings with respect to time and memory efficiency in practice.
- 15 July 2021
- Published by Springer Nature
- p. 435-446
Open AccessAIGEN: Random Generation of Symbolic Transition Systems
AIGEN is an open source tool for the generation of transition systems in a symbolic representation. To ensure diversity, it employs a uniform random sampling over the space of all Boolean functions with a given number of variables. AIGEN relies on reduced ordered binary decision diagrams (ROBDDs) and canonical disjunctive normal form (CDNF) as canonical representations that allow us to enumerate Boolean functions, in the former case with an encoding that is inspired by data structures used to implement ROBDDs. Several parameters allow the user to restrict generation to Boolean functions or transition systems with certain properties, which are then output in AIGER format. We report on the use of AIGEN to generate random benchmark problems for the reactive synthesis competition SYNTCOMP 2019, and present a comparison of the two encodings with respect to time and memory efficiency in practice.
- 13 January 2020
- Published by Springer Nature
- p. 337-359
Promptness and Bounded Fairness in Concurrent and Parameterized Systems
- 13 January 2020
- Published by Springer Nature
- p. 337-359
Promptness and Bounded Fairness in Concurrent and Parameterized Systems
- 4 October 2019
- Published by Springer Nature in Acta Informatica
- Vol. 57 (1-2) , 81-106
A symbolic algorithm for lazy synthesis of eager strategies
- 4 October 2019
- Published by Springer Nature in Acta Informatica
- Vol. 57 (1-2) , 81-106
A symbolic algorithm for lazy synthesis of eager strategies
- 30 September 2018
- Published by Springer Nature
- p. 211-227
A Symbolic Algorithm for Lazy Synthesis of Eager Strategies
- 30 September 2018
- Published by Springer Nature
- p. 211-227
A Symbolic Algorithm for Lazy Synthesis of Eager Strategies
- 29 December 2017
- Published by Springer Nature
- p. 247-268
Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity
- 29 December 2017
- Published by Springer Nature
- p. 247-268
Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity