This workshop will discuss aspects of quantitative algebraic reasoning through a series of chalkboard talks and collaborative working sessions. The talks will be oriented towards background material and open problems to stimulate discussion between participants.

The exact programme is still evolving and will ultimately be tailored towards the interests of the participants. Among others, possible topics include

• expressivity of quantitative algebra
• logical aspects of quantitative algebra (e.g. proof theory)
• specification of quantitative systems and semantics

Please indicate your interest in participating in the workshop and any topics that especially interest you directly in the workshop stream of the Highlights Zulip server. You can also contact Chase Ford (Leiden University) or Henning Urbat (Friedrich-Alexander-Universität Erlangen-Nürnberg) by email for further details.

This workshop aims to gather researchers in formal verification and synthesis of concurrent systems involving unboundedly many agents. We will focus on the following themes:

• Parameterized verification of networks (rendez-vous, broadcast, shared memory, message channels)
• Control of populations of finite-state systems
• Verification of systems with dynamic process creation

All problems in these and related themes are welcome. We encourage participants to bring their own problems, and to announce their participation on the dedicated Zulip channel. If you wish to present a result on these subjects, we may leave some room for talks. However the workshop is mainly meant as an opportunity for discussion.

A major advancement in language modeling is the use of the transformer architecture. But what problems can transformers solve, what problems can they not solve, and how can we prove it? In this workshop, we will examine the expressivity of transformers through the lens of computability and complexity theory. We situate transformers within the landscape of automata, boolean circuits, and formal logics. We discuss what is currently known about transformers’ capabilities and limitations, address practical implications for NLP, and identify directions for future work. Participants gain a comprehensive understanding of transformers’ expressive power.

The lecture-driven part of the workshop is on the first 3 days, with the last 2 days reserved for potential exploration of research questions. In the lecture-driven part, we will have 2-hour lectures in the morning and we will review proofs and extra lecture notes in the afternoon, identifying questions along the way.

Lecture notes and slides are from David Chiang, John Rawski, Lena Strobl, and Andy Yang (ESSLLI'24).

In this workshop, we will explore open problems in the broad area of games on graphs. The event will span 2 to 3 days, starting on a Monday. On the first day, we will hold an open problem session, and for the remaining days, we will break into groups to work on the problems and share progress.

If you're interested in joining, please let me know. And if possible, come prepared with a few open problems in your pocket! 🙂