LIPIcs, Volume 140, CONCUR 2019

• Wan Fokkink and Rob van Glabbeek LIPIcs, Volume 140, CONCUR'19, Complete Volume 10.4230/LIPIcs.CONCUR.2019
• Wan Fokkink and Rob van Glabbeek Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CONCUR.2019.0
• Marta Z. Kwiatkowska Safety Verification for Deep Neural Networks with Provable Guarantees (Invited Paper) 10.4230/LIPIcs.CONCUR.2019.1
• Kim G. Larsen Synthesis of Safe, Optimal and Compact Strategies for Stochastic Hybrid Games (Invited Paper) 10.4230/LIPIcs.CONCUR.2019.2
• Joël Ouaknine Program Invariants (Invited Talk) 10.4230/LIPIcs.CONCUR.2019.3
• Jaco van de Pol Concurrent Algorithms and Data Structures for Model Checking (Invited Talk) 10.4230/LIPIcs.CONCUR.2019.4
• Jan Křetínský and Tobias Meggendorfer Of Cores: A Partial-Exploration Framework for Markov Decision Processes 10.4230/LIPIcs.CONCUR.2019.5
• Krishnendu Chatterjee and Nir Piterman Combinations of Qualitative Winning for Stochastic Parity Games 10.4230/LIPIcs.CONCUR.2019.6
• Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, and Alexander Svozil Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs 10.4230/LIPIcs.CONCUR.2019.7
• Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, and Mickael Randour Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives 10.4230/LIPIcs.CONCUR.2019.8
• Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, and Franck van Breugel Computing Probabilistic Bisimilarity Distances for Probabilistic Automata 10.4230/LIPIcs.CONCUR.2019.9
• Dmitry Chistikov, Andrzej S. Murawski, and David Purser Asymmetric Distances for Approximate Differential Privacy 10.4230/LIPIcs.CONCUR.2019.10
• Marc de Visme Event Structures for Mixed Choice 10.4230/LIPIcs.CONCUR.2019.11
• Alain Finkel and M. Praveen Verification of Flat FIFO Systems 10.4230/LIPIcs.CONCUR.2019.12
• Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, and Marie van den Bogaard The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games 10.4230/LIPIcs.CONCUR.2019.13
• Tobias Winkler, Sebastian Junges, Guillermo A. Pérez, and Joost-Pieter Katoen On the Complexity of Reachability in Parametric Markov Decision Processes 10.4230/LIPIcs.CONCUR.2019.14
• Lorenzo Clemente, Piotr Hofman, and Patrick Totzke Timed Basic Parallel Processes 10.4230/LIPIcs.CONCUR.2019.15
• R. Govind, Frédéric Herbreteau, B. Srivathsan, and Igor Walukiewicz Revisiting Local Time Semantics for Networks of Timed Automata 10.4230/LIPIcs.CONCUR.2019.16
• Jakub Michaliszyn and Jan Otop Approximate Learning of Limit-Average Automata 10.4230/LIPIcs.CONCUR.2019.17
• Laure Daviaud, Marcin Jurdziński, and Karoliina Lehtinen Alternating Weak Automata from Universal Trees 10.4230/LIPIcs.CONCUR.2019.18
• Udi Boker and Karoliina Lehtinen Good for Games Automata: From Nondeterminism to Alternation 10.4230/LIPIcs.CONCUR.2019.19
• Milad Aghajohari, Guy Avni, and Thomas A. Henzinger Determinacy in Discrete-Bidding Infinite-Duration Games 10.4230/LIPIcs.CONCUR.2019.20
• Véronique Bruyère, Quentin Hautem, Mickael Randour, and Jean-François Raskin Energy Mean-Payoff Games 10.4230/LIPIcs.CONCUR.2019.21
• Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, and Michael Wooldridge Equilibrium Design for Concurrent Games 10.4230/LIPIcs.CONCUR.2019.22
• Frederik Meyer Bønneland, Peter Gjøl Jensen, Kim G. Larsen, Marco Muñiz, and Jiří Srba Partial Order Reduction for Reachability Games 10.4230/LIPIcs.CONCUR.2019.23
• Léo Exibard, Emmanuel Filiot, and Pierre-Alain Reynier Synthesis of Data Word Transducers 10.4230/LIPIcs.CONCUR.2019.24
• Ayrat Khalimov and Orna Kupferman Register-Bounded Synthesis 10.4230/LIPIcs.CONCUR.2019.25
• Raven Beutner, Bernd Finkbeiner, and Jesko Hecking-Harbusch Translating Asynchronous Games for Distributed Synthesis 10.4230/LIPIcs.CONCUR.2019.26
• Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop Long-Run Average Behavior of Vector Addition Systems with States 10.4230/LIPIcs.CONCUR.2019.27
• Filip Mazowiecki and Michał Pilipczuk Reachability for Bounded Branching VASS 10.4230/LIPIcs.CONCUR.2019.28
• Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, and Frank Valencia Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents 10.4230/LIPIcs.CONCUR.2019.29
• Sidi Mohamed Beillahi, Ahmed Bouajjani, and Constantin Enea Robustness Against Transactional Causal Consistency 10.4230/LIPIcs.CONCUR.2019.30
• Michael Blondin, Javier Esparza, and Stefan Jaax Expressive Power of Broadcast Consensus Protocols 10.4230/LIPIcs.CONCUR.2019.31
• Nathalie Bertrand, Patricia Bouyer, and Anirban Majumdar Reconfiguration and Message Losses in Parameterized Broadcast Networks 10.4230/LIPIcs.CONCUR.2019.32
• Nathalie Bertrand, Igor Konnov, Marijana Lazić, and Josef Widder Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries 10.4230/LIPIcs.CONCUR.2019.33
• Jérémy Ledent and Samuel Mimram A Sound Foundation for the Topological Approach to Task Solvability 10.4230/LIPIcs.CONCUR.2019.34
• Daniel Hausmann and Lutz Schröder Game-Based Local Model Checking for the Coalgebraic mu-Calculus 10.4230/LIPIcs.CONCUR.2019.35
• Ulrich Dorsch, Stefan Milius, and Lutz Schröder Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum 10.4230/LIPIcs.CONCUR.2019.36
• Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, and Fabio Zanasi Bialgebraic Semantics for String Diagrams 10.4230/LIPIcs.CONCUR.2019.37
• Mario Bravetti, Marco Carbone, Julien Lange, Nobuko Yoshida, and Gianluigi Zavattaro A Sound Algorithm for Asynchronous Session Subtyping 10.4230/LIPIcs.CONCUR.2019.38
• Luís Caires, Jorge A. Pérez, Frank Pfenning, and Bernardo Toninho Domain-Aware Session Types 10.4230/LIPIcs.CONCUR.2019.39
• Hendrik Maarand and Tarmo Uustalu Reordering Derivatives of Trace Closures of Regular Languages 10.4230/LIPIcs.CONCUR.2019.40
• Tobias Kappé, Paul Brunet, Jurriaan Rot, Alexandra Silva, Jana Wagemaker, and Fabio Zanasi Kleene Algebra with Observations 10.4230/LIPIcs.CONCUR.2019.41