Accepted papers

Ross HorneSession Subtyping and Multiparty Compatibility using Circular Sequents
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi and Patrick TotzkeStrategy Complexity of Parity Objectives in Countable MDPs
Emanuele D'Osualdo and Felix StutzDecidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions
A. R. Balasubramanian and Igor WalukiewiczCharacterizing consensus in the Heard-Of model
Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi and Dominik WojtczakReduction from Stochastic Parity Games to Stochastic Reachability Games for Model-Free Reinforcement Learning
Shaull Almagor, Nathann Cohen, Guillermo Perez, Mahsa Shirmohammadi and James WorrellCoverability in 1-VASS with Disequality Tests
Wojciech Czerwiński, Sławomir Lasota, Ranko Lazic, Jérôme Leroux and Filip MazowieckiReachability in fixed dimension vector addition systems with states
Clément Aubert and Ioana CristescuHow Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
Javier Esparza and Fabian ReiterA Classification of Weak Asynchronous Models of Distributed Computing
Krishnendu Chatterjee, Thomas Henzinger and Jan OtopMulti-dimensional Long-Run Average Problems for Vector Addition Systems with States
Ankush Das and Frank PfenningSession Types with Arithmetic Refinements
Eike Neumann, Joel Ouaknine and James WorrellOn Ranking Function Synthesis and Termination for Polynomial Programs
Patricia Bouyer, Stephane Le Roux, Youssouf Oualhadj, Mickael Randour and Pierre VandenhoveGames Where You Can Play Optimally with Arena-Independent Finite Memory
Mikhail Raskin, Chana Weil-Kennedy and Javier EsparzaFlatness and Complexity of Immediate Observation Petri Nets
Paul Bell and Pavel SemukhinDecidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs
Doriana Medić and Ivan LaneseA general approach to derive uncontrolled reversible semantics
Jérôme Leroux and Grégoire SutreReachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free
Dmitry Chistikov, Stefan Kiefer, Andrzej Murawski and David PurserThe Big-O Problem for Labelled Markov Chains and Weighted Automata
David N. Jansen, Jan Friso Groote, Ferry Timmers and Pengfei YangA Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
Matteo Mio and Valeria VignudelliMonads and Quantitative Equational Theories for Nondeterminism and Probability
Rob van GlabbeekReactive Bisimulation Semantics for a Process Algebra with Time-outs
Florian Horn and Arnaud SangnierDeciding the existence of cut-off in parameterized rendez-vous networks
Jana Wagemaker, Paul Brunet, Simon Docherty, Tobias Kappé, Jurriaan Rot and Alexandra SilvaPartially Observable Concurrent Kleene Algebra
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan and Ashutosh TrivediWeighted Transducers for Robustness Verification
Damien Busatto-Gaston, Debraj Chakraborty, Gilles Geeraerts and Jean-Francois RaskinMonte Carlo Tree Search guided by Symbolic Advice for MDPs
Daniel Hirschkoff, Enguerrand Prebet and Davide SangiorgiOn the Representation of References in the Pi-calculus
Rupak Majumdar, Joel Ouaknine, Amaury Pouly and James WorrellAlgebraic Invariants for Linear Hybrid Automata
Paolo Baldan, Barbara König and Tommaso PadoanAbstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
Shaull Almagor, Udi Boker, Piotr Hofman and Patrick TotzkeParametrized Universality Problems for One-Counter Nets
Jens Oliver Gutsfeld, Markus Müller-Olm and Christoph OhremPropositional Dynamic Logic for Hyperproperties
Omar Inverso, Hernán Melgratti, Luca Padovani, Catia Trubiani and Emilio TuostoProbabilistic Analysis of Binary Sessions
Benedikt Bollig, Alain Finkel and Amrita SureshBounded Reachability Problems are Decidable in FIFO Machines
Lorenzo Clemente, Sławomir Lasota and Radosław PiórkowskiDeterminizability of one-clock timed automata
Parosh Abdulla, Mohamed Faouzi Atig, Vrunda Dave and Krishna SOn the Separability Problem of String Constraints
Luca Aceto, Valentina Castiglioni, Anna Ingolfsdottir, Bas Luttik and Mathias Ruggaard PedersenOn the Axiomatisability of Parallel Composition: A Journey in the Spectrum
Paul Wild and Lutz SchröderCharacteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Wojciech Czerwiński, Diego Figueira and Piotr HofmanUniversality Problem for Unambiguous VASS
Xinxin Liu and Tingting YuCanonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations
Dan Plyukhin and Gul AghaScalable Termination Detection for Distributed Actor Systems
Vrunda Dave, Emmanuel Filiot, Krishna S and Nathan LhoteSynthesis of Computable Regular Functions of Infinite Words
Saptarshi Sarkar, Bharat Adsul, Paul Gastin and Pascal WeilWreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
Joshua Moerman and Matteo SammartinoResidual Nominal Automata
Francesco RanzatoDecidability and Synthesis of Abstract Inductive Invariants
Amina Doumane and Damien PousNon axiomatizability of positive relation algebras with constants, via graph homomorphisms
Benjamin Monmege, Julie Parreaux and Pierre-Alain ReynierReaching Your Goal Optimally by Playing at Random


CONCUR 2020 is sponsored as part of QONFEST 2020 by:


Official Carrier