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