Strategy templates are similar to classical strategies typically computed by reactive software synthesis but contain a huge set of relevant strategies in a succinct and simple data structure. This permissiveness allows efficient adaptations to new specifications as
well as robustness to unexpected actuation failures during runtime. In addition to these favorable engineering properties of strategy templates for cyber-physical systems (CPS), their permissiveness, efficient computability, and adaptability enables their use for the automated synthesis of certified interfaces among multiple interacting agents.

The publications listed below discuss the formal synthesis of strategy templates for different specification classes and cooperation modes among agents. In addition to these theoretical foundations, we have recently applied PeSTels-inspired techniques in different domains, such as AI-shielding, multi-robot interaction, context-triggered control design, and synthesis of infinite-state programs.

Overview Paper:

• ®A. Anand, S.P. Nayak, A.-K. Schmuck. Strategy Templates – Robust Certified Interfaces for Interacting Systems. 2024. ATVA’24 (invited paper) (PDF)

(Past) Group Members Involved:

• Satya Prakash Nayak
• Ashwani Anand
• Ritam Raha
• Anne-Kathrin Schmuck

Tools:

• CoSMo : Contracted Strategy Mask Negotiation in two-objective parity games [GitHub]
• PeSTel : A tool for computing Permissive Strategy Templates for (generalized) parity games [ GitHub ]
• SImPA : A tool for computing Sufficient, Implementable and Permissive Assumptions for parity games [ GitLab ]

Publications:

• A. Anand, C. Baier, C. Chau, S. Knueppelholz,  A. Mirzaei, S.P. Nayak, A.-K. Schmuck. Concurrent Permissive Strategy Templates. 2026. TACAS’26 (PDF)
• * A. Anand, S.P. Nayak, R. Raha, I. Sağlam, A.-K. Schmuck. Quantitative Strategy Templates. 2025. ATVA’25. (extended version)
• ® A. Anand, A.-K. Schmuck, and S. P. Nayak. Contract-Based Distributed Logical Controller Synthesis. 2024. HSCC’24 (PDF, Extended Version, HSCC’23 poster) (HSCC’23 best poster award)
• * S. P. Nayak, A.-K. Schmuck. Most General Winning Secure Equilibria Synthesis in Graph Games. 2024. TACAS’24 (PDF, extended version)
• * A. Anand, S. P. Nayak, and A.-K. Schmuck. Contract-Based Distributed Logical Controller Synthesis. 2024. HSCC’24 (to appear, Arxiv preprint, HSCC’23 poster) (HSCC’23 best poster award)
• * A. Anand, S. P. Nayak, and A.-K. Schmuck. Synthesizing Permissive Winning Strategy Templates for Parity Games. 2023. CAV’23. (PDF, extended version)
• * A. Anand, K. Mallik, S. P. Nayak, and A.-K. Schmuck. Computing Adequately Permissive Assumptions for Synthesis. 2023. TACAS’23. (PDF, extended version)

all publications list authors either in alphabetic (indicated by a pink *) or in randomized (indicated by a purple ®) order, with their publicly verifiable record of the randomization available here.