Abstract is missing.
- Reasoning About Distributed Knowledge of Groups with Infinitely Many AgentsMichell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, Frank Valencia. [doi]
- Asymmetric Distances for Approximate Differential PrivacyDmitry Chistikov, Andrzej S. Murawski, David Purser. [doi]
- A Sound Algorithm for Asynchronous Session SubtypingMario Bravetti, Marco Carbone, Julien Lange, Nobuko Yoshida, Gianluigi Zavattaro. [doi]
- Bialgebraic Semantics for String DiagramsFilippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi. [doi]
- Program Invariants (Invited Talk)Joël Ouaknine. [doi]
- Reachability for Bounded Branching VASSFilip Mazowiecki, Michal Pilipczuk. [doi]
- Good for Games Automata: From Nondeterminism to AlternationUdi Boker, Karoliina Lehtinen. [doi]
- Domain-Aware Session TypesLuís Caires, Jorge A. Pérez, Frank Pfenning, Bernardo Toninho. [doi]
- Life Is Random, Time Is Not: Markov Decision Processes with Window ObjectivesThomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Concurrent Algorithms and Data Structures for Model Checking (Invited Talk)Jaco van de Pol. [doi]
- Approximate Learning of Limit-Average AutomataJakub Michaliszyn, Jan Otop. [doi]
- Game-Based Local Model Checking for the Coalgebraic mu-CalculusDaniel Hausmann, Lutz Schröder. [doi]
- Alternating Weak Automata from Universal TreesLaure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen. [doi]
- Reconfiguration and Message Losses in Parameterized Broadcast NetworksNathalie Bertrand 0001, Patricia Bouyer, Anirban Majumdar. [doi]
- Partial Order Reduction for Reachability GamesFrederik M. Bønneland, Peter Gjøl Jensen, Kim G. Larsen, Marco Muñiz, Jirí Srba. [doi]
- Verification of Flat FIFO SystemsAlain Finkel, M. Praveen. [doi]
- Kleene Algebra with ObservationsTobias Kappé, Paul Brunet, Jurriaan Rot, Alexandra Silva 0001, Jana Wagemaker, Fabio Zanasi. [doi]
- A Sound Foundation for the Topological Approach to Task SolvabilityJérémy Ledent, Samuel Mimram. [doi]
- On the Complexity of Reachability in Parametric Markov Decision ProcessesTobias Winkler, Sebastian Junges, Guillermo A. Pérez, Joost-Pieter Katoen. [doi]
- Safety Verification for Deep Neural Networks with Provable Guarantees (Invited Paper)Marta Z. Kwiatkowska. [doi]
- Expressive Power of Broadcast Consensus ProtocolsMichael Blondin, Javier Esparza, Stefan Jaax. [doi]
- Timed Basic Parallel ProcessesLorenzo Clemente, Piotr Hofman, Patrick Totzke. [doi]
- Combinations of Qualitative Winning for Stochastic Parity GamesKrishnendu Chatterjee, Nir Piterman. [doi]
- Verification of Randomized Consensus Algorithms Under Round-Rigid AdversariesNathalie Bertrand 0001, Igor Konnov 0001, Marijana Lazic, Josef Widder. [doi]
- Revisiting Local Time Semantics for Networks of Timed AutomataR. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. [doi]
- Computing Probabilistic Bisimilarity Distances for Probabilistic AutomataGiorgio Bacci, Giovanni Bacci 0001, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel. [doi]
- Graded Monads and Graded Logics for the Linear Time - Branching Time SpectrumUlrich Dorsch, Stefan Milius, Lutz Schröder. [doi]
- The Complexity of Subgame Perfect Equilibria in Quantitative Reachability GamesThomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard. [doi]
- Translating Asynchronous Games for Distributed SynthesisRaven Beutner, Bernd Finkbeiner, Jesko Hecking-Harbusch. [doi]
- Event Structures for Mixed ChoiceMarc de Visme. [doi]
- Equilibrium Design for Concurrent GamesJulian Gutierrez 0001, Muhammad Najib, Giuseppe Perelli, Michael J. Wooldridge. [doi]
- Long-Run Average Behavior of Vector Addition Systems with StatesKrishnendu Chatterjee, Thomas A. Henzinger, Jan Otop. [doi]
- Synthesis of Data Word TransducersLéo Exibard, Emmanuel Filiot, Pierre-Alain Reynier. [doi]
- Of Cores: A Partial-Exploration Framework for Markov Decision ProcessesJan Kretínský, Tobias Meggendorfer. [doi]
- Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPsKrishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil. [doi]
- Synthesis of Safe, Optimal and Compact Strategies for Stochastic Hybrid Games (Invited Paper)Kim G. Larsen. [doi]
- Energy Mean-Payoff GamesVéronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin. [doi]
- Reordering Derivatives of Trace Closures of Regular LanguagesHendrik Maarand, Tarmo Uustalu. [doi]
- Determinacy in Discrete-Bidding Infinite-Duration GamesMilad Aghajohari, Guy Avni, Thomas A. Henzinger. [doi]
- Register-Bounded SynthesisAyrat Khalimov, Orna Kupferman. [doi]
- Robustness Against Transactional Causal ConsistencySidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea. [doi]