LIPIcs, Volume 171, CONCUR 2020

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