Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Rupak Majumdar, Madhavan Mukund, Felix Stutz, Damien Zufferey |
Generalising Projection in Asynchronous Multiparty Session Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 35:1-35:24, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Henning Urbat, Daniel Hausmann 0001, Stefan Milius, Lutz Schröder |
Nominal Büchi Automata with Name Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 4:1-4:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ming Xu 0010, Jingyi Mei, Ji Guan, Nengkun Yu |
Model Checking Quantum Continuous-Time Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 13:1-13:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Serge Haddad, Daniele Varacca (eds.) |
32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7 The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
1 | Simon Foster 0001, Chung-Kil Hur, Jim Woodcock 0001 |
Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 20:1-20:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Nathalie Bertrand 0001, Bastien Thomas, Josef Widder |
Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 15:1-15:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Simon Fowler 0001, Wen Kokke, Ornela Dardha, Sam Lindley, J. Garrett Morris |
Separating Sessions Smoothly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 36:1-36:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Michele Boreale, Daniele Gorla |
Algebra and Coalgebra of Stream Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 19:1-19:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jan Friso Groote, Jan Martens 0001, Erik P. de Vink |
Bisimulation by Partitioning Is Ω((m+n)log n). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 31:1-31:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Christel Baier, Florian Funke 0002, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell 0001 |
The Orbit Problem for Parametric Linear Dynamical Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 28:1-28:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rucha Kulkarni, Umang Mathur 0001, Andreas Pavlogiannis |
Dynamic Data-Race Detection Through the Fine-Grained Lens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 16:1-16:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato |
Inclusion Testing of Büchi Automata Based on Well-Quasiorders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 3:1-3:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Aneesh K. Shetty, S. Krishna 0004, Georg Zetzsche |
Scope-Bounded Reachability in Valence Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 29:1-29:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Michal Ajdarów, Antonín Kucera 0001 |
Deciding Polynomial Termination Complexity for VASS Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 30:1-30:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Kozachinskiy |
Continuous Positional Payoffs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 10:1-10:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove |
Arena-Independent Finite-Memory Determinacy in Stochastic Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 26:1-26:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke |
Transience in Countable MDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 11:1-11:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rob van Glabbeek, Peter Höfner, Weiyou Wang |
Enabling Preserving Bisimulation Equivalence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 33:1-33:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-203-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen |
On the Axiomatisability of Parallel Composition: A Journey in the Spectrum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 18:1-18:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | A. R. Balasubramanian, Igor Walukiewicz |
Characterizing Consensus in the Heard-Of Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 9:1-9:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Benedikt Bollig, Alain Finkel, Amrita Suresh 0001 |
Bounded Reachability Problems Are Decidable in FIFO Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 49:1-49:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mário S. Alvim, Natasha Fernandes, Annabelle McIver, Gabriel Henrique Nunes |
On Privacy and Accuracy in Data Releases (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 1:1-1:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rob van Glabbeek |
Reactive Bisimulation Semantics for a Process Algebra with Time-Outs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 6:1-6:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech Czerwinski, Diego Figueira, Piotr Hofman |
Universality Problem for Unambiguous VASS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 36:1-36:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi |
On the Representation of References in the Pi-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 34:1-34:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote |
Synthesis of Computable Regular Functions of Infinite Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 43:1-43:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke |
Parametrized Universality Problems for One-Counter Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 47:1-47:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 0:1-0:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Xinxin Liu 0009, Tingting Yu |
Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 35:1-35:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Patricia Bouyer, Stéphane Le Roux 0001, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove |
Games Where You Can Play Optimally with Arena-Independent Finite Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 24:1-24:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Florian Horn 0001, Arnaud Sangnier |
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 46:1-46:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Matteo Mio, Valeria Vignudelli |
Monads and Quantitative Equational Theories for Nondeterminism and Probability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 28:1-28:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Emanuele D'Osualdo, Felix Stutz |
Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 31:1-31:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amina Doumane, Damien Pous |
Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 29:1-29:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Luca Aceto, Jos C. M. Baeten, Patricia Bouyer-Decitre, Holger Hermanns, Alexandra Silva 0001 |
CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 5:1-5:3, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Clément Aubert, Ioana Cristescu |
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 7:1-7:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jérôme Leroux, Grégoire Sutre |
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 37:1-37:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Paul C. Bell, Pavel Semukhin |
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 22:1-22:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Catuscia Palamidessi, Marco Romanelli 0002 |
Modern Applications of Game-Theoretic Principles (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 4:1-4:9, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke |
Strategy Complexity of Parity Objectives in Countable MDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 39:1-39:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shaull Almagor, Nathann Cohen, Guillermo A. Pérez 0001, Mahsa Shirmohammadi, James Worrell 0001 |
Coverability in 1-VASS with Disequality Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 38:1-38:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ross Horne |
Session Subtyping and Multiparty Compatibility Using Circular Sequents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 12:1-12:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Javier Esparza, Fabian Reiter |
A Classification of Weak Asynchronous Models of Distributed Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 10:1-10:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Bharat Adsul, Paul Gastin, Saptarshi Sarkar 0001, Pascal Weil |
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 19:1-19:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ivan Lanese, Doriana Medic |
A General Approach to Derive Uncontrolled Reversible Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 33:1-33:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Chistikov 0001, Stefan Kiefer, Andrzej S. Murawski, David Purser |
The Big-O Problem for Labelled Markov Chains and Weighted Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 41:1-41:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Guy Avni, Thomas A. Henzinger |
A Survey of Bidding Games on Graphs (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 2:1-2:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eike Neumann, Joël Ouaknine, James Worrell 0001 |
On Ranking Function Synthesis and Termination for Polynomial Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 15:1-15:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Omar Inverso, Hernán C. Melgratti, Luca Padovani, Catia Trubiani, Emilio Tuosto |
Probabilistic Analysis of Binary Sessions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 14:1-14:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop |
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 23:1-23:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave, Shankara Narayanan Krishna |
On the Separability Problem of String Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 16:1-16:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Igor Konnov 0001, Laura Kovács (eds.) |
31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
1 | Wojciech Czerwinski, Slawomir Lasota 0001, Ranko Lazic 0001, Jérôme Leroux, Filip Mazowiecki |
Reachability in Fixed Dimension Vector Addition Systems with States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 48:1-48:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Paul Wild, Lutz Schröder |
Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 27:1-27:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi 0001, Dominik Wojtczak |
Model-Free Reinforcement Learning for Stochastic Parity Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 21:1-21:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell 0001 |
Algebraic Invariants for Linear Hybrid Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 32:1-32:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Paolo Baldan, Barbara König 0001, Tommaso Padoan |
Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 25:1-25:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dan Plyukhin, Gul Agha |
Scalable Termination Detection for Distributed Actor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 11:1-11:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan 0001, Ashutosh Trivedi 0001 |
Weighted Transducers for Robustness Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 17:1-17:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ankush Das, Frank Pfenning |
Session Types with Arithmetic Refinements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 13:1-13:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier |
Reaching Your Goal Optimally by Playing at Random with No Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 26:1-26:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jens Oliver Gutsfeld, Markus Müller-Olm, Christoph Ohrem |
Propositional Dynamic Logic for Hyperproperties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 50:1-50:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jana Wagemaker, Paul Brunet, Simon Docherty, Tobias Kappé, Jurriaan Rot, Alexandra Silva 0001 |
Partially Observable Concurrent Kleene Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 20:1-20:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Francesco Ranzato |
Decidability and Synthesis of Abstract Inductive Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 30:1-30:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Lorenzo Clemente, Slawomir Lasota 0001, Radoslaw Piórkowski |
Determinisability of One-Clock Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 42:1-42:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nils Jansen 0001, Bettina Könighofer, Sebastian Junges, Alex Serban, Roderick Bloem |
Safe Reinforcement Learning Using Probabilistic Shields (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 3:1-3:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Damien Busatto-Gaston, Debraj Chakraborty 0002, Jean-François Raskin |
Monte Carlo Tree Search Guided by Symbolic Advice for MDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 40:1-40:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Moerman, Matteo Sammartino |
Residual Nominal Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 44:1-44:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | David N. Jansen, Jan Friso Groote, Ferry Timmers, Pengfei Yang |
A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 8:1-8:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza |
Flatness and Complexity of Immediate Observation Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 45:1-45:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, Frank Valencia |
Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 29:1-29:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ayrat Khalimov 0001, Orna Kupferman |
Register-Bounded Synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 25:1-25:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Milad Aghajohari, Guy Avni, Thomas A. Henzinger |
Determinacy in Discrete-Bidding Infinite-Duration Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 20:1-20:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin |
Energy Mean-Payoff Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 21:1-21:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jan Kretínský, Tobias Meggendorfer |
Of Cores: A Partial-Exploration Framework for Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 5:1-5:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop |
Long-Run Average Behavior of Vector Addition Systems with States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 27:1-27:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Raven Beutner, Bernd Finkbeiner, Jesko Hecking-Harbusch |
Translating Asynchronous Games for Distributed Synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 26:1-26:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Julian Gutierrez 0001, Muhammad Najib, Giuseppe Perelli, Michael J. Wooldridge |
Equilibrium Design for Concurrent Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 22:1-22:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Krishnendu Chatterjee, Nir Piterman |
Combinations of Qualitative Winning for Stochastic Parity Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 6:1-6:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Wan J. Fokkink, Rob van Glabbeek (eds.) |
30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil |
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 7:1-7:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jaco van de Pol |
Concurrent Algorithms and Data Structures for Model Checking (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 4:1-4:1, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mario Bravetti, Marco Carbone, Julien Lange, Nobuko Yoshida, Gianluigi Zavattaro |
A Sound Algorithm for Asynchronous Session Subtyping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 38:1-38:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Filip Mazowiecki, Michal Pilipczuk |
Reachability for Bounded Branching VASS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 28:1-28:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour |
Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 8:1-8:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier |
Synthesis of Data Word Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 24:1-24:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Frederik M. Bønneland, Peter Gjøl Jensen, Kim G. Larsen, Marco Muñiz, Jirí Srba |
Partial Order Reduction for Reachability Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 23:1-23:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Hausmann 0001, Lutz Schröder |
Game-Based Local Model Checking for the Coalgebraic mu-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 35:1-35:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 0:1-0:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Lorenzo Clemente, Piotr Hofman, Patrick Totzke |
Timed Basic Parallel Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 15:1-15:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jakub Michaliszyn, Jan Otop |
Approximate Learning of Limit-Average Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 17:1-17:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kim G. Larsen |
Synthesis of Safe, Optimal and Compact Strategies for Stochastic Hybrid Games (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 2:1-2:5, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Tobias Winkler, Sebastian Junges, Guillermo A. Pérez 0001, Joost-Pieter Katoen |
On the Complexity of Reachability in Parametric Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 14:1-14:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Michael Blondin, Javier Esparza, Stefan Jaax |
Expressive Power of Broadcast Consensus Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 31:1-31:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 13:1-13:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski 0001, Fabio Zanasi |
Bialgebraic Semantics for String Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 37:1-37:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Tobias Kappé, Paul Brunet, Jurriaan Rot, Alexandra Silva 0001, Jana Wagemaker, Fabio Zanasi |
Kleene Algebra with Observations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 41:1-41:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Nathalie Bertrand 0001, Igor Konnov 0001, Marijana Lazic, Josef Widder |
Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 33:1-33:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea |
Robustness Against Transactional Causal Consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 30:1-30:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | R. Govind 0001, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz |
Revisiting Local Time Semantics for Networks of Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 16:1-16:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-121-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|