CONCUR20: CONCUR 2020: 31ST INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY

A
Abdulla, Parosh	On the Separability Problem of String Constraints
Aceto, Luca	On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
Adsul, Bharat	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
Agha, Gul	Scalable Termination Detection for Distributed Actor Systems
Almagor, Shaull	Parametrized Universality Problems for One-Counter Nets Coverability in 1-VASS with Disequality Tests
Atig, Mohamed Faouzi	On the Separability Problem of String Constraints
Aubert, Clément	How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
B
Balasubramanian, A. R.	Characterizing consensus in the Heard-Of model
Baldan, Paolo	Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
Bell, Paul	Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs
Bloem, Roderick	Safe Reinforcement Learning using Probabilistic Shields
Boker, Udi	Parametrized Universality Problems for One-Counter Nets
Bollig, Benedikt	Bounded Reachability Problems are Decidable in FIFO Machines
Bouyer, Patricia	Games Where You Can Play Optimally with Arena-Independent Finite Memory
Brunet, Paul	Partially Observable Concurrent Kleene Algebra
Busatto-Gaston, Damien	Monte Carlo Tree Search guided by Symbolic Advice for MDPs
C
Castiglioni, Valentina	On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
Chakraborty, Debraj	Monte Carlo Tree Search guided by Symbolic Advice for MDPs
Chatterjee, Krishnendu	Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States
Chistikov, Dmitry	The Big-O Problem for Labelled Markov Chains and Weighted Automata
Clemente, Lorenzo	Determinizability of one-clock timed automata
Cohen, Nathann	Coverability in 1-VASS with Disequality Tests
Cristescu, Ioana	How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
Czerwiński, Wojciech	Universality Problem for Unambiguous VASS Reachability in fixed dimension vector addition systems with states
D
D'Osualdo, Emanuele	Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions
Das, Ankush	Session Types with Arithmetic Refinements
Dave, Vrunda	Synthesis of Computable Regular Functions of Infinite Words On the Separability Problem of String Constraints
Docherty, Simon	Partially Observable Concurrent Kleene Algebra
Doumane, Amina	Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
E
Esparza, Javier	A Classification of Weak Asynchronous Models of Distributed Computing Flatness and Complexity of Immediate Observation Petri Nets
F
Figueira, Diego	Universality Problem for Unambiguous VASS
Filiot, Emmanuel	Synthesis of Computable Regular Functions of Infinite Words Weighted Transducers for Robustness Verification
Finkel, Alain	Bounded Reachability Problems are Decidable in FIFO Machines
G
Gastin, Paul	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
Groote, Jan Friso	A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
Gutsfeld, Jens Oliver	Propositional Dynamic Logic for Hyperproperties
H
Hahn, Ernst Moritz	Model-Free Reinforcement Learning for Stochastic Parity Games
Henzinger, Thomas	Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States A Survey of Bidding Games on Graphs
Hirschkoff, Daniel	On the Representation of References in the Pi-calculus
Hofman, Piotr	Parametrized Universality Problems for One-Counter Nets Universality Problem for Unambiguous VASS
Horn, Florian	Deciding the existence of cut-off in parameterized rendez-vous networks
Horne, Ross	Session Subtyping and Multiparty Compatibility using Circular Sequents
I
Ingolfsdottir, Anna	On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
Inverso, Omar	Probabilistic Analysis of Binary Sessions
J
Jansen, David N.	A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
K
Kappé, Tobias	Partially Observable Concurrent Kleene Algebra
Kiefer, Stefan	The Big-O Problem for Labelled Markov Chains and Weighted Automata Strategy Complexity of Parity Objectives in Countable MDPs
König, Barbara	Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
L
Lanese, Ivan	A general approach to derive uncontrolled reversible semantics
Lasota, Sławomir	Determinizability of one-clock timed automata Reachability in fixed dimension vector addition systems with states
Lazic, Ranko	Reachability in fixed dimension vector addition systems with states
Le Roux, Stephane	Games Where You Can Play Optimally with Arena-Independent Finite Memory
Leroux, Jérôme	Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free Reachability in fixed dimension vector addition systems with states
Lhote, Nathan	Synthesis of Computable Regular Functions of Infinite Words
Liu, Xinxin	Canonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations
Luttik, Bas	On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
M
Majumdar, Rupak	Algebraic Invariants for Linear Hybrid Automata
Mayr, Richard	Strategy Complexity of Parity Objectives in Countable MDPs
Mazowiecki, Filip	Reachability in fixed dimension vector addition systems with states
Mazzocchi, Nicolas	Weighted Transducers for Robustness Verification
McIver, Annabelle	On Privacy and Accuracy in Data Releases
Medić, Doriana	A general approach to derive uncontrolled reversible semantics
Melgratti, Hernán	Probabilistic Analysis of Binary Sessions
Mio, Matteo	Monads and Quantitative Equational Theories for Nondeterminism and Probability
Moerman, Joshua	Residual Nominal Automata
Monmege, Benjamin	Reaching Your Goal Optimally by Playing at Random
Murawski, Andrzej	The Big-O Problem for Labelled Markov Chains and Weighted Automata
Müller-Olm, Markus	Propositional Dynamic Logic for Hyperproperties
N
Neumann, Eike	On Ranking Function Synthesis and Termination for Polynomial Programs
O
Ohrem, Christoph	Propositional Dynamic Logic for Hyperproperties
Otop, Jan	Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States
Ouaknine, Joel	Algebraic Invariants for Linear Hybrid Automata On Ranking Function Synthesis and Termination for Polynomial Programs
Oualhadj, Youssouf	Games Where You Can Play Optimally with Arena-Independent Finite Memory
P
Padoan, Tommaso	Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
Padovani, Luca	Probabilistic Analysis of Binary Sessions
Palamidessi, Catuscia	Modern Applications of Game-Theoretic Principles
Parreaux, Julie	Reaching Your Goal Optimally by Playing at Random
Pedersen, Mathias Ruggaard	On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
Perez, Guillermo	Coverability in 1-VASS with Disequality Tests
Perez, Mateo	Model-Free Reinforcement Learning for Stochastic Parity Games
Pfenning, Frank	Session Types with Arithmetic Refinements
Piórkowski, Radosław	Determinizability of one-clock timed automata
Plyukhin, Dan	Scalable Termination Detection for Distributed Actor Systems
Pouly, Amaury	Algebraic Invariants for Linear Hybrid Automata
Pous, Damien	Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
Prebet, Enguerrand	On the Representation of References in the Pi-calculus
Purser, David	The Big-O Problem for Labelled Markov Chains and Weighted Automata
R
Randour, Mickael	Games Where You Can Play Optimally with Arena-Independent Finite Memory
Ranzato, Francesco	Decidability and Synthesis of Abstract Inductive Invariants
Raskin, Jean-François	Weighted Transducers for Robustness Verification Monte Carlo Tree Search guided by Symbolic Advice for MDPs
Raskin, Mikhail	Flatness and Complexity of Immediate Observation Petri Nets
Reiter, Fabian	A Classification of Weak Asynchronous Models of Distributed Computing
Reynier, Pierre-Alain	Reaching Your Goal Optimally by Playing at Random
Rot, Jurriaan	Partially Observable Concurrent Kleene Algebra
S
S, Krishna	Synthesis of Computable Regular Functions of Infinite Words On the Separability Problem of String Constraints
Sammartino, Matteo	Residual Nominal Automata
Sangiorgi, Davide	On the Representation of References in the Pi-calculus
Sangnier, Arnaud	Deciding the existence of cut-off in parameterized rendez-vous networks
Sankaranarayanan, Sriram	Weighted Transducers for Robustness Verification
Sarkar, Saptarshi	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
Schewe, Sven	Model-Free Reinforcement Learning for Stochastic Parity Games
Schröder, Lutz	Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Semukhin, Pavel	Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs
Shirmohammadi, Mahsa	Coverability in 1-VASS with Disequality Tests Strategy Complexity of Parity Objectives in Countable MDPs
Silva, Alexandra	Partially Observable Concurrent Kleene Algebra
Somenzi, Fabio	Model-Free Reinforcement Learning for Stochastic Parity Games
Stutz, Felix	Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions
Suresh, Amrita	Bounded Reachability Problems are Decidable in FIFO Machines
Sutre, Grégoire	Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free
T
Timmers, Ferry	A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
Totzke, Patrick	Parametrized Universality Problems for One-Counter Nets Strategy Complexity of Parity Objectives in Countable MDPs
Trivedi, Ashutosh	Model-Free Reinforcement Learning for Stochastic Parity Games Weighted Transducers for Robustness Verification
Trubiani, Catia	Probabilistic Analysis of Binary Sessions
Tuosto, Emilio	Probabilistic Analysis of Binary Sessions
V
van Glabbeek, Rob	Reactive Bisimulation Semantics for a Process Algebra with Time-outs
Vandenhove, Pierre	Games Where You Can Play Optimally with Arena-Independent Finite Memory
Vignudelli, Valeria	Monads and Quantitative Equational Theories for Nondeterminism and Probability
W
Wagemaker, Jana	Partially Observable Concurrent Kleene Algebra
Walukiewicz, Igor	Characterizing consensus in the Heard-Of model
Weil, Pascal	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
Weil-Kennedy, Chana	Flatness and Complexity of Immediate Observation Petri Nets
Wild, Paul	Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Wojtczak, Dominik	Model-Free Reinforcement Learning for Stochastic Parity Games
Worrell, James	Algebraic Invariants for Linear Hybrid Automata Coverability in 1-VASS with Disequality Tests On Ranking Function Synthesis and Termination for Polynomial Programs
Y
Yang, Pengfei	A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
Yu, Tingting	Canonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations

Disclaimer | Powered by EasyChair Smart Program