<h2>LIPIcs, Volume 171, CONCUR 2020</h2>
<ul>
<li>
<span class="authors">Igor Konnov and Laura Kovács</span>
<span class="title">LIPIcs, Volume 171, CONCUR 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020">10.4230/LIPIcs.CONCUR.2020</a>
</li>
<li>
<span class="authors">Igor Konnov and Laura Kovács</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.0">10.4230/LIPIcs.CONCUR.2020.0</a>
</li>
<li>
<span class="authors">Mário S. Alvim, Natasha Fernandes, Annabelle McIver, and Gabriel H. Nunes</span>
<span class="title">On Privacy and Accuracy in Data Releases (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.1">10.4230/LIPIcs.CONCUR.2020.1</a>
</li>
<li>
<span class="authors">Guy Avni and Thomas A. Henzinger</span>
<span class="title">A Survey of Bidding Games on Graphs (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.2">10.4230/LIPIcs.CONCUR.2020.2</a>
</li>
<li>
<span class="authors">Nils Jansen, Bettina Könighofer, Sebastian Junges, Alex Serban, and Roderick Bloem</span>
<span class="title">Safe Reinforcement Learning Using Probabilistic Shields (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.3">10.4230/LIPIcs.CONCUR.2020.3</a>
</li>
<li>
<span class="authors">Catuscia Palamidessi and Marco Romanelli</span>
<span class="title">Modern Applications of Game-Theoretic Principles (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.4">10.4230/LIPIcs.CONCUR.2020.4</a>
</li>
<li>
<span class="authors">Luca Aceto, Jos Baeten, Patricia Bouyer-Decitre, Holger Hermanns, and Alexandra Silva</span>
<span class="title">CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.5">10.4230/LIPIcs.CONCUR.2020.5</a>
</li>
<li>
<span class="authors">Rob van Glabbeek</span>
<span class="title">Reactive Bisimulation Semantics for a Process Algebra with Time-Outs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.6">10.4230/LIPIcs.CONCUR.2020.6</a>
</li>
<li>
<span class="authors">Clément Aubert and Ioana Cristescu</span>
<span class="title">How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.7">10.4230/LIPIcs.CONCUR.2020.7</a>
</li>
<li>
<span class="authors">David N. Jansen, Jan Friso Groote, Ferry Timmers, and Pengfei Yang</span>
<span class="title">A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.8">10.4230/LIPIcs.CONCUR.2020.8</a>
</li>
<li>
<span class="authors">A. R. Balasubramanian and Igor Walukiewicz</span>
<span class="title">Characterizing Consensus in the Heard-Of Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.9">10.4230/LIPIcs.CONCUR.2020.9</a>
</li>
<li>
<span class="authors">Javier Esparza and Fabian Reiter</span>
<span class="title">A Classification of Weak Asynchronous Models of Distributed Computing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.10">10.4230/LIPIcs.CONCUR.2020.10</a>
</li>
<li>
<span class="authors">Dan Plyukhin and Gul Agha</span>
<span class="title">Scalable Termination Detection for Distributed Actor Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.11">10.4230/LIPIcs.CONCUR.2020.11</a>
</li>
<li>
<span class="authors">Ross Horne</span>
<span class="title">Session Subtyping and Multiparty Compatibility Using Circular Sequents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.12">10.4230/LIPIcs.CONCUR.2020.12</a>
</li>
<li>
<span class="authors">Ankush Das and Frank Pfenning</span>
<span class="title">Session Types with Arithmetic Refinements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.13">10.4230/LIPIcs.CONCUR.2020.13</a>
</li>
<li>
<span class="authors">Omar Inverso, Hernán Melgratti, Luca Padovani, Catia Trubiani, and Emilio Tuosto</span>
<span class="title">Probabilistic Analysis of Binary Sessions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.14">10.4230/LIPIcs.CONCUR.2020.14</a>
</li>
<li>
<span class="authors">Eike Neumann, Joël Ouaknine, and James Worrell</span>
<span class="title">On Ranking Function Synthesis and Termination for Polynomial Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.15">10.4230/LIPIcs.CONCUR.2020.15</a>
</li>
<li>
<span class="authors">Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave, and Shankara Narayanan Krishna</span>
<span class="title">On the Separability Problem of String Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.16">10.4230/LIPIcs.CONCUR.2020.16</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan, and Ashutosh Trivedi</span>
<span class="title">Weighted Transducers for Robustness Verification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.17">10.4230/LIPIcs.CONCUR.2020.17</a>
</li>
<li>
<span class="authors">Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, and Mathias Ruggaard Pedersen</span>
<span class="title">On the Axiomatisability of Parallel Composition: A Journey in the Spectrum</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.18">10.4230/LIPIcs.CONCUR.2020.18</a>
</li>
<li>
<span class="authors">Bharat Adsul, Paul Gastin, Saptarshi Sarkar, and Pascal Weil</span>
<span class="title">Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.19">10.4230/LIPIcs.CONCUR.2020.19</a>
</li>
<li>
<span class="authors">Jana Wagemaker, Paul Brunet, Simon Docherty, Tobias Kappé, Jurriaan Rot, and Alexandra Silva</span>
<span class="title">Partially Observable Concurrent Kleene Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.20">10.4230/LIPIcs.CONCUR.2020.20</a>
</li>
<li>
<span class="authors">Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, and Dominik Wojtczak</span>
<span class="title">Model-Free Reinforcement Learning for Stochastic Parity Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.21">10.4230/LIPIcs.CONCUR.2020.21</a>
</li>
<li>
<span class="authors">Paul C. Bell and Pavel Semukhin</span>
<span class="title">Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.22">10.4230/LIPIcs.CONCUR.2020.22</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop</span>
<span class="title">Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.23">10.4230/LIPIcs.CONCUR.2020.23</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove</span>
<span class="title">Games Where You Can Play Optimally with Arena-Independent Finite Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.24">10.4230/LIPIcs.CONCUR.2020.24</a>
</li>
<li>
<span class="authors">Paolo Baldan, Barbara König, and Tommaso Padoan</span>
<span class="title">Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.25">10.4230/LIPIcs.CONCUR.2020.25</a>
</li>
<li>
<span class="authors">Benjamin Monmege, Julie Parreaux, and Pierre-Alain Reynier</span>
<span class="title">Reaching Your Goal Optimally by Playing at Random with No Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.26">10.4230/LIPIcs.CONCUR.2020.26</a>
</li>
<li>
<span class="authors">Paul Wild and Lutz Schröder</span>
<span class="title">Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.27">10.4230/LIPIcs.CONCUR.2020.27</a>
</li>
<li>
<span class="authors">Matteo Mio and Valeria Vignudelli</span>
<span class="title">Monads and Quantitative Equational Theories for Nondeterminism and Probability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.28">10.4230/LIPIcs.CONCUR.2020.28</a>
</li>
<li>
<span class="authors">Amina Doumane and Damien Pous</span>
<span class="title">Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.29">10.4230/LIPIcs.CONCUR.2020.29</a>
</li>
<li>
<span class="authors">Francesco Ranzato</span>
<span class="title">Decidability and Synthesis of Abstract Inductive Invariants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.30">10.4230/LIPIcs.CONCUR.2020.30</a>
</li>
<li>
<span class="authors">Emanuele D'Osualdo and Felix Stutz</span>
<span class="title">Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.31">10.4230/LIPIcs.CONCUR.2020.31</a>
</li>
<li>
<span class="authors">Rupak Majumdar, Joël Ouaknine, Amaury Pouly, and James Worrell</span>
<span class="title">Algebraic Invariants for Linear Hybrid Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.32">10.4230/LIPIcs.CONCUR.2020.32</a>
</li>
<li>
<span class="authors">Ivan Lanese and Doriana Medić</span>
<span class="title">A General Approach to Derive Uncontrolled Reversible Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.33">10.4230/LIPIcs.CONCUR.2020.33</a>
</li>
<li>
<span class="authors">Daniel Hirschkoff, Enguerrand Prebet, and Davide Sangiorgi</span>
<span class="title">On the Representation of References in the Pi-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.34">10.4230/LIPIcs.CONCUR.2020.34</a>
</li>
<li>
<span class="authors">Xinxin Liu and TingTing Yu</span>
<span class="title">Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.35">10.4230/LIPIcs.CONCUR.2020.35</a>
</li>
<li>
<span class="authors">Wojciech Czerwiński, Diego Figueira, and Piotr Hofman</span>
<span class="title">Universality Problem for Unambiguous VASS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.36">10.4230/LIPIcs.CONCUR.2020.36</a>
</li>
<li>
<span class="authors">Jérôme Leroux and Grégoire Sutre</span>
<span class="title">Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.37">10.4230/LIPIcs.CONCUR.2020.37</a>
</li>
<li>
<span class="authors">Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, and James Worrell</span>
<span class="title">Coverability in 1-VASS with Disequality Tests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.38">10.4230/LIPIcs.CONCUR.2020.38</a>
</li>
<li>
<span class="authors">Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, and Patrick Totzke</span>
<span class="title">Strategy Complexity of Parity Objectives in Countable MDPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.39">10.4230/LIPIcs.CONCUR.2020.39</a>
</li>
<li>
<span class="authors">Damien Busatto-Gaston, Debraj Chakraborty, and Jean-Francois Raskin</span>
<span class="title">Monte Carlo Tree Search Guided by Symbolic Advice for MDPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.40">10.4230/LIPIcs.CONCUR.2020.40</a>
</li>
<li>
<span class="authors">Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, and David Purser</span>
<span class="title">The Big-O Problem for Labelled Markov Chains and Weighted Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.41">10.4230/LIPIcs.CONCUR.2020.41</a>
</li>
<li>
<span class="authors">Lorenzo Clemente, Sławomir Lasota, and Radosław Piórkowski</span>
<span class="title">Determinisability of One-Clock Timed Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.42">10.4230/LIPIcs.CONCUR.2020.42</a>
</li>
<li>
<span class="authors">Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, and Nathan Lhote</span>
<span class="title">Synthesis of Computable Regular Functions of Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.43">10.4230/LIPIcs.CONCUR.2020.43</a>
</li>
<li>
<span class="authors">Joshua Moerman and Matteo Sammartino</span>
<span class="title">Residual Nominal Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.44">10.4230/LIPIcs.CONCUR.2020.44</a>
</li>
<li>
<span class="authors">Mikhail Raskin, Chana Weil-Kennedy, and Javier Esparza</span>
<span class="title">Flatness and Complexity of Immediate Observation Petri Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.45">10.4230/LIPIcs.CONCUR.2020.45</a>
</li>
<li>
<span class="authors">Florian Horn and Arnaud Sangnier</span>
<span class="title">Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.46">10.4230/LIPIcs.CONCUR.2020.46</a>
</li>
<li>
<span class="authors">Shaull Almagor, Udi Boker, Piotr Hofman, and Patrick Totzke</span>
<span class="title">Parametrized Universality Problems for One-Counter Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.47">10.4230/LIPIcs.CONCUR.2020.47</a>
</li>
<li>
<span class="authors">Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, and Filip Mazowiecki</span>
<span class="title">Reachability in Fixed Dimension Vector Addition Systems with States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.48">10.4230/LIPIcs.CONCUR.2020.48</a>
</li>
<li>
<span class="authors">Benedikt Bollig, Alain Finkel, and Amrita Suresh</span>
<span class="title">Bounded Reachability Problems Are Decidable in FIFO Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.49">10.4230/LIPIcs.CONCUR.2020.49</a>
</li>
<li>
<span class="authors">Jens Oliver Gutsfeld, Markus Müller-Olm, and Christoph Ohrem</span>
<span class="title">Propositional Dynamic Logic for Hyperproperties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2020.50">10.4230/LIPIcs.CONCUR.2020.50</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