default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th CONCUR 2019: Amsterdam, the Netherlands
- Wan J. Fokkink, Rob van Glabbeek:
30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands. LIPIcs 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-121-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:14
- Marta Z. Kwiatkowska
:
Safety Verification for Deep Neural Networks with Provable Guarantees (Invited Paper). 1:1-1:5 - Kim G. Larsen:
Synthesis of Safe, Optimal and Compact Strategies for Stochastic Hybrid Games (Invited Paper). 2:1-2:5 - Joël Ouaknine:
Program Invariants (Invited Talk). 3:1-3:1 - Jaco van de Pol:
Concurrent Algorithms and Data Structures for Model Checking (Invited Talk). 4:1-4:1 - Jan Kretínský, Tobias Meggendorfer:
Of Cores: A Partial-Exploration Framework for Markov Decision Processes. 5:1-5:17 - Krishnendu Chatterjee, Nir Piterman:
Combinations of Qualitative Winning for Stochastic Parity Games. 6:1-6:17 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. 7:1-7:16 - Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives. 8:1-8:18 - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel:
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. 9:1-9:17 - Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Asymmetric Distances for Approximate Differential Privacy. 10:1-10:17 - Marc de Visme:
Event Structures for Mixed Choice. 11:1-11:16 - Alain Finkel, M. Praveen:
Verification of Flat FIFO Systems. 12:1-12:17 - Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. 13:1-13:16 - Tobias Winkler, Sebastian Junges, Guillermo A. Pérez, Joost-Pieter Katoen:
On the Complexity of Reachability in Parametric Markov Decision Processes. 14:1-14:17 - Lorenzo Clemente, Piotr Hofman, Patrick Totzke:
Timed Basic Parallel Processes. 15:1-15:16 - R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Revisiting Local Time Semantics for Networks of Timed Automata. 16:1-16:15 - Jakub Michaliszyn, Jan Otop:
Approximate Learning of Limit-Average Automata. 17:1-17:16 - Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen:
Alternating Weak Automata from Universal Trees. 18:1-18:14 - Udi Boker, Karoliina Lehtinen:
Good for Games Automata: From Nondeterminism to Alternation. 19:1-19:16 - Milad Aghajohari, Guy Avni, Thomas A. Henzinger:
Determinacy in Discrete-Bidding Infinite-Duration Games. 20:1-20:17 - Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin:
Energy Mean-Payoff Games. 21:1-21:17 - Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, Michael J. Wooldridge:
Equilibrium Design for Concurrent Games. 22:1-22:16 - Frederik M. Bønneland, Peter Gjøl Jensen, Kim G. Larsen, Marco Muñiz, Jirí Srba:
Partial Order Reduction for Reachability Games. 23:1-23:15 - Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
Synthesis of Data Word Transducers. 24:1-24:15 - Ayrat Khalimov, Orna Kupferman:
Register-Bounded Synthesis. 25:1-25:16 - Raven Beutner, Bernd Finkbeiner, Jesko Hecking-Harbusch:
Translating Asynchronous Games for Distributed Synthesis. 26:1-26:16 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Long-Run Average Behavior of Vector Addition Systems with States. 27:1-27:16 - Filip Mazowiecki, Michal Pilipczuk:
Reachability for Bounded Branching VASS. 28:1-28:13 - Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, Frank Valencia:
Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents. 29:1-29:15 - Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Robustness Against Transactional Causal Consistency. 30:1-30:18 - Michael Blondin, Javier Esparza, Stefan Jaax:
Expressive Power of Broadcast Consensus Protocols. 31:1-31:16 - Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks. 32:1-32:15 - Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder:
Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. 33:1-33:15 - Jérémy Ledent, Samuel Mimram:
A Sound Foundation for the Topological Approach to Task Solvability. 34:1-34:15 - Daniel Hausmann, Lutz Schröder:
Game-Based Local Model Checking for the Coalgebraic mu-Calculus. 35:1-35:16 - Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. 36:1-36:16 - Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Bialgebraic Semantics for String Diagrams. 37:1-37:17 - Mario Bravetti, Marco Carbone, Julien Lange, Nobuko Yoshida, Gianluigi Zavattaro:
A Sound Algorithm for Asynchronous Session Subtyping. 38:1-38:16 - Luís Caires, Jorge A. Pérez, Frank Pfenning, Bernardo Toninho:
Domain-Aware Session Types. 39:1-39:17 - Hendrik Maarand, Tarmo Uustalu:
Reordering Derivatives of Trace Closures of Regular Languages. 40:1-40:16 - Tobias Kappé, Paul Brunet, Jurriaan Rot, Alexandra Silva, Jana Wagemaker, Fabio Zanasi:
Kleene Algebra with Observations. 41:1-41:16
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-02-21 19:42 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:
