Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Ezio Bartocci, Thomas A. Henzinger, Dejan Nickovic, Ana Oliveira da Costa |
Hypernode Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 21:1-21:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Guy Avni, Pranav Ghorpade, Shibashis Guha |
A Game of Pawns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 16:1-16:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shankara Narayanan Krishna, Khushraj Nanik Madnani, Rupak Majumdar, Paritosh K. Pandya |
Satisfiability Checking of Multi-Variable TPTL with Unilateral Intervals Is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 23:1-23:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alain Finkel, Serge Haddad, Lina Ye |
About Decisiveness of Dynamic Probabilistic Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 14:1-14:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 0:1-0:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Bengt Jonsson 0001, Marta Kwiatkowska, Igor Walukiewicz |
CONCUR Test-Of-Time Award 2023 (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 1:1-1:2, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | P. H. M. van Spaendonck, Tim A. C. Willemse |
The Best of Both Worlds: Model-Driven Engineering Meets Model-Based Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 4:1-4:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sven Schewe, Qiyi Tang 0001, Tansholpan Zhanabekova |
Deciding What Is Good-For-MDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 35:1-35:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sougata Bose, David Purser, Patrick Totzke |
History-Deterministic Vector Addition Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 18:1-18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Roland Guttenberg, Mikhail A. Raskin, Javier Esparza |
Geometry of Reachability Sets of Vector Addition Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 6:1-6:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alessandro Abate, Alec Edwards, Mirco Giacobbe, Hashan Punchihewa, Diptarko Roy |
Quantitative Verification with Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 22:1-22:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Corto Mascle, Anca Muscholl, Igor Walukiewicz |
Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 24:1-24:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pascal Baumann 0001, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche |
Monus Semantics in Vector Addition Systems with States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 10:1-10:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault |
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 33:1-33:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ashwani Anand, Georg Zetzsche |
Priority Downward Closures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 39:1-39:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Orna Kupferman, Noam Shenwald |
Games with Trading of Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 19:1-19:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gil Silva 0002, Andreia Mordido, Vasco T. Vasconcelos |
Subtyping Context-Free Session Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 11:1-11:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yong Li 0031, Sven Schewe, Moshe Y. Vardi |
Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 37:1-37:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eren Keskin, Roland Meyer 0001 |
Separability and Non-Determinizability of WSTS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 8:1-8:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jesús Domínguez, Aleksandar Nanevski |
Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 30:1-30:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder |
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 7:1-7:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anna Schmitt 0002, Kirstin Peters |
Probabilistic Operational Correspondence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 15:1-15:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hagit Attiya, Constantin Enea, Shafik Nassar |
Faithful Simulation of Randomized BFT Protocols on Block DAGs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 27:1-27:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Christoph Haase, Radoslaw Piórkowski |
Universal Quantification Makes Automatic Structures Hard to Decide. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 13:1-13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Azalea Raad, Julien Vanegue, Josh Berdine, Peter W. O'Hearn |
A General Approach to Under-Approximate Reasoning About Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 25:1-25:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann 0002 |
History-Deterministic Parikh Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 31:1-31:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Stéphane Demri, Karin Quaas |
Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 29:1-29:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Myrthe S. C. Spronck, Bas Luttik |
Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 5:1-5:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Guillermo A. Pérez 0001, Jean-François Raskin (eds.) |
34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
1 | Michal Ajdarów, Antonín Kucera 0001 |
Asymptotic Complexity Estimates for Probabilistic Programs and Their VASS Abstractions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 12:1-12:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Radu Iosif, Florian Zuleger |
Expressiveness Results for an Inductive Logic of Separated Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 20:1-20:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tiange Liu, Alwen Tiu, Jim de Groot |
Modal Logics for Mobile Processes Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 34:1-34:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Omri Isac, Yoni Zohar, Clark W. Barrett, Guy Katz |
DNN Verification, Reachability, and the Exponential Function Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 26:1-26:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jakub Michaliszyn, Jan Otop, Piotr Wieczorek |
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 3:1-3:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Åsmund Aqissiaq Arild Kløvstad, Eduard Kamburjan, Einar Broch Johnsen |
Compositional Correctness and Completeness for Symbolic Partial Order Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 9:1-9:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç |
Safety and Liveness of Quantitative Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 17:1-17:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Petr Jancar, Jérôme Leroux |
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 36:1-36:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ahmed Bouajjani |
On Verifying Concurrent Programs Under Weakly Consistent Models (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 2:1-2:1, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jan Friso Groote, Tim A. C. Willemse |
Real Equation Systems with Alternating Fixed-Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 28:1-28:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ugo Dal Lago, Maurizio Murgia 0001 |
Contextual Behavioural Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 38:1-38:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jan Martens 0001, Jan Friso Groote |
Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, pp. 32:1-32:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-299-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Christel Baier, Florian Funke 0002, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell 0001 |
Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 10:1-10:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove |
Half-Positional Objectives Recognized by Deterministic Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 20:1-20:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jiarui Gan, Rupak Majumdar, Goran Radanovic, Adish Singla |
Sequential Decision Making With Information Asymmetry (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 4:1-4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech Czerwinski, Piotr Hofman |
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 16:1-16:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Javier Esparza, Mikhail A. Raskin, Christoph Welzel |
Regular Model Checking Upside-Down: An Invariant-Based Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 23:1-23:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Marius Bozga, Lucas Bueri, Radu Iosif |
On an Invariance Problem for Parameterized Concurrent Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 24:1-24:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ugo Dal Lago, Giulia Giusti |
On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 37:1-37:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Kush Grover, Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger |
Anytime Guarantees for Reachability in Uncountable Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 11:1-11:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Véronique Bruyère, Jean-François Raskin, Clément Tamines |
Pareto-Rational Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 33:1-33:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sergio Rajsbaum |
Distributed Decision Problems: Concurrent Specifications Beyond Binary Relations (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 3:1-3:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi |
CONCUR Test-Of-Time Award 2022 (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 1:1-1:3, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Damien Pous, Jana Wagemaker |
Completeness Theorems for Kleene Algebra with Top. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 26:1-26:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik |
On the Axiomatisation of Branching Bisimulation Congruence over CCS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 6:1-6:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Oscar Darwin, Stefan Kiefer |
On the Sequential Probability Ratio Test in Hidden Markov Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 9:1-9:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ira Fesefeldt, Joost-Pieter Katoen, Thomas Noll 0001 |
Towards Concurrent Quantitative Separation Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 25:1-25:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim |
Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 31:1-31:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Victor Khomenko, Maciej Koutny, Alex Yakovlev |
Slimming down Petri Boxes: Compact Petri Net Models of Control Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 8:1-8:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier |
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 15:1-15:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Filiot, Edwin Hamel-De le Court |
Two-Player Boundedness Counter Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 21:1-21:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Philippa Gardner |
Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 2:1-2:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech Czerwinski |
Involved VASS Zoo (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 5:1-5:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Thomas A. Henzinger, Karoliina Lehtinen, Patrick Totzke |
History-Deterministic Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 14:1-14:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Bharat Adsul, Paul Gastin, Saptarshi Sarkar 0001, Pascal Weil |
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 28:1-28:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Orna Kupferman, Naama Shamash Halevy |
Energy Games with Resource-Bounded Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 19:1-19:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | S. Akshay 0001, Paul Gastin, R. Govind 0001, B. Srivathsan |
Simulations for Event-Clock Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 13:1-13:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shaull Almagor, Shai Guendelman |
Concurrent Games with Multiple Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 34:1-34:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Kiefer, Qiyi Tang 0001 |
Strategies for MDP Bisimilarity Equivalence and Inequivalence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 32:1-32:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Clément Aubert, Ross Horne, Christian Johansen |
Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 30:1-30:26, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz |
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 12:1-12:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Laura Bozzelli, Adriano Peron, César Sánchez 0001 |
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 27:1-27:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | A. R. Balasubramanian |
Complexity of Coverability in Depth-Bounded Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 17:1-17:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Uli Fahrenberg, Christian Johansen, Georg Struth, Krzysztof Ziemianski |
A Kleene Theorem for Higher-Dimensional Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 29:1-29:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Bartek Klin, Slawomir Lasota 0001, Anca Muscholl (eds.) |
33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4 The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
1 | Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt |
Non-Deterministic Abstract Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 7:1-7:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 0:1-0:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shaull Almagor, Asaf Yeshurun |
Determinization of One-Counter Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 18:1-18:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Adam D. Barwell, Alceste Scalas, Nobuko Yoshida, Fangyi Zhou 0002 |
Generalised Multiparty Session Types with Crash-Stop Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 35:1-35:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | James C. A. Main, Mickael Randour |
Different Strokes in Randomised Strategies: Revisiting Kuhn's Theorem Under Finite-Memory Assumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 22:1-22:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Luca Ciccone, Luca Padovani |
An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 36:1-36:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Muhammad Syifa'ul Mufid, Andrea Micheli, Alessandro Abate, Alessandro Cimatti |
SMT-Based Model Checking of Max-Plus Linear Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 22:1-22: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 | Raven Beutner, Bernd Finkbeiner |
A Temporal Logic for Strategic Hyperproperties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 24:1-24: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 | Stefan Kiefer, Pavel Semukhin, Cas Widdershoven |
Linear-Time Model Checking Branching Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 6:1-6: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 | Nathalie Bertrand 0001, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, Nobuko Yoshida |
CONCUR Test-Of-Time Award 2021 (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 1:1-1:3, 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 | Jakob Piribauer, Christel Baier, Nathalie Bertrand 0001, Ocan Sankur |
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 7:1-7: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 | Richard Mayr, Eric Munday |
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives 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. 12:1-12: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 | Léonard Brice, Jean-François Raskin, Marie van den Bogaard |
Subgame-Perfect Equilibria in Mean-Payoff Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 8:1-8: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 | James C. A. Main, Mickael Randour, Jeremy Sproston |
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 25:1-25: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 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 0:1-0:14, 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 | Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf 0002 |
Decomposing Permutation Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 18:1-18: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 | Vojtech Havlena, Ondrej Lengál |
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 2:1-2: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 | Florian Bruse, Martin Lange |
A Decidable Non-Regular Modal Fixpoint Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 23:1-23: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 | Mayuko Kori, Ichiro Hasuo, Shin-ya Katsumata |
Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside Down. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 21:1-21: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 | Mrudula Balachander, Shibashis Guha, Jean-François Raskin |
Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 9:1-9: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 | Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh 0001 |
A Unifying Framework for Deciding Synchronizability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 14:1-14: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 | A. R. Balasubramanian, K. S. Thejaswini |
Adaptive Synchronisation of Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 17:1-17: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 | Thorsten Wißmann, Stefan Milius, Lutz Schröder |
Explaining Behavioural Inequivalence Generically in Quasilinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 32:1-32: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 | Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi 0001 |
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 34:1-34: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 | Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger |
Enforcing ω-Regular Properties in Markov Chains by Restarting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 5:1-5: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 | Véronique Bruyère, Jean-François Raskin, Clément Tamines |
Stackelberg-Pareto Synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference., pp. 27:1-27: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 |
|