default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st CONCUR 2020: Vienna, Austria (Virtual Conference)
- Igor Konnov
, Laura Kovács:
31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference). LIPIcs 171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-160-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Mário S. Alvim, Natasha Fernandes, Annabelle McIver, Gabriel Henrique Nunes:
On Privacy and Accuracy in Data Releases (Invited Paper). 1:1-1:18 - Guy Avni, Thomas A. Henzinger:
A Survey of Bidding Games on Graphs (Invited Paper). 2:1-2:21 - Nils Jansen, Bettina Könighofer, Sebastian Junges, Alex Serban, Roderick Bloem:
Safe Reinforcement Learning Using Probabilistic Shields (Invited Paper). 3:1-3:16 - Catuscia Palamidessi, Marco Romanelli:
Modern Applications of Game-Theoretic Principles (Invited Paper). 4:1-4:9 - Luca Aceto, Jos C. M. Baeten, Patricia Bouyer-Decitre, Holger Hermanns, Alexandra Silva:
CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). 5:1-5:3 - Rob van Glabbeek:
Reactive Bisimulation Semantics for a Process Algebra with Time-Outs. 6:1-6:23 - Clément Aubert, Ioana Cristescu:
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation. 7:1-7:23 - David N. Jansen, Jan Friso Groote, Ferry Timmers, Pengfei Yang:
A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains. 8:1-8:20 - A. R. Balasubramanian, Igor Walukiewicz:
Characterizing Consensus in the Heard-Of Model. 9:1-9:18 - Javier Esparza, Fabian Reiter:
A Classification of Weak Asynchronous Models of Distributed Computing. 10:1-10:16 - Dan Plyukhin, Gul Agha:
Scalable Termination Detection for Distributed Actor Systems. 11:1-11:23 - Ross Horne:
Session Subtyping and Multiparty Compatibility Using Circular Sequents. 12:1-12:22 - Ankush Das, Frank Pfenning:
Session Types with Arithmetic Refinements. 13:1-13:18 - Omar Inverso, Hernán C. Melgratti, Luca Padovani, Catia Trubiani, Emilio Tuosto:
Probabilistic Analysis of Binary Sessions. 14:1-14:21 - Eike Neumann, Joël Ouaknine, James Worrell:
On Ranking Function Synthesis and Termination for Polynomial Programs. 15:1-15:15 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave, Shankara Narayanan Krishna:
On the Separability Problem of String Constraints. 16:1-16:19 - Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan, Ashutosh Trivedi:
Weighted Transducers for Robustness Verification. 17:1-17:21 - Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the Axiomatisability of Parallel Composition: A Journey in the Spectrum. 18:1-18:22 - Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. 19:1-19:17 - Jana Wagemaker, Paul Brunet, Simon Docherty, Tobias Kappé, Jurriaan Rot, Alexandra Silva:
Partially Observable Concurrent Kleene Algebra. 20:1-20:22 - Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak:
Model-Free Reinforcement Learning for Stochastic Parity Games. 21:1-21:16 - Paul C. Bell, Pavel Semukhin:
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. 22:1-22:16 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. 23:1-23:22 - Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Arena-Independent Finite Memory. 24:1-24:22 - Paolo Baldan, Barbara König, Tommaso Padoan:
Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations. 25:1-25:20 - Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Reaching Your Goal Optimally by Playing at Random with No Memory. 26:1-26:21 - Paul Wild, Lutz Schröder:
Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. 27:1-27:23 - Matteo Mio, Valeria Vignudelli:
Monads and Quantitative Equational Theories for Nondeterminism and Probability. 28:1-28:18 - Amina Doumane, Damien Pous:
Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms. 29:1-29:16 - Francesco Ranzato:
Decidability and Synthesis of Abstract Inductive Invariants. 30:1-30:21 - Emanuele D'Osualdo, Felix Stutz:
Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. 31:1-31:23 - Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell:
Algebraic Invariants for Linear Hybrid Automata. 32:1-32:17 - Ivan Lanese, Doriana Medic:
A General Approach to Derive Uncontrolled Reversible Semantics. 33:1-33:24 - Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi:
On the Representation of References in the Pi-Calculus. 34:1-34:20 - Xinxin Liu, Tingting Yu:
Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. 35:1-35:17 - Wojciech Czerwinski, Diego Figueira, Piotr Hofman:
Universality Problem for Unambiguous VASS. 36:1-36:15 - Jérôme Leroux, Grégoire Sutre:
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free. 37:1-37:17 - Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. 38:1-38:20 - Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Parity Objectives in Countable MDPs. 39:1-39:17 - Damien Busatto-Gaston, Debraj Chakraborty, Jean-François Raskin:
Monte Carlo Tree Search Guided by Symbolic Advice for MDPs. 40:1-40:24 - Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. 41:1-41:19 - Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of One-Clock Timed Automata. 42:1-42:17 - Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote:
Synthesis of Computable Regular Functions of Infinite Words. 43:1-43:17 - Joshua Moerman, Matteo Sammartino:
Residual Nominal Automata. 44:1-44:21 - Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza:
Flatness and Complexity of Immediate Observation Petri Nets. 45:1-45:19 - Florian Horn, Arnaud Sangnier:
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. 46:1-46:16 - Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke:
Parametrized Universality Problems for One-Counter Nets. 47:1-47:16 - Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in Fixed Dimension Vector Addition Systems with States. 48:1-48:21 - Benedikt Bollig, Alain Finkel, Amrita Suresh:
Bounded Reachability Problems Are Decidable in FIFO Machines. 49:1-49:17 - Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem:
Propositional Dynamic Logic for Hyperproperties. 50:1-50:22
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-01 15:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
