default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd CONCUR 2021
- Serge Haddad
, Daniele Varacca:
32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference. LIPIcs 203, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-203-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:14
- Nathalie Bertrand, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, Nobuko Yoshida:
CONCUR Test-Of-Time Award 2021 (Invited Paper). 1:1-1:3 - Vojtech Havlena, Ondrej Lengál:
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation. 2:1-2:19 - Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato:
Inclusion Testing of Büchi Automata Based on Well-Quasiorders. 3:1-3:22 - Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. 4:1-4:16 - Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger:
Enforcing ω-Regular Properties in Markov Chains by Restarting. 5:1-5:22 - Stefan Kiefer, Pavel Semukhin, Cas Widdershoven:
Linear-Time Model Checking Branching Processes. 6:1-6:16 - Jakob Piribauer, Christel Baier, Nathalie Bertrand, Ocan Sankur:
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. 7:1-7:18 - Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
Subgame-Perfect Equilibria in Mean-Payoff Games. 8:1-8:17 - Mrudula Balachander, Shibashis Guha, Jean-François Raskin:
Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games. 9:1-9:17 - Alexander Kozachinskiy:
Continuous Positional Payoffs. 10:1-10:17 - Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Transience in Countable MDPs. 11:1-11:15 - Richard Mayr, Eric Munday:
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs. 12:1-12:15 - Ming Xu, Jingyi Mei, Ji Guan, Nengkun Yu:
Model Checking Quantum Continuous-Time Markov Chains. 13:1-13:17 - Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh:
A Unifying Framework for Deciding Synchronizability. 14:1-14:18 - Nathalie Bertrand, Bastien Thomas, Josef Widder:
Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms. 15:1-15:17 - Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis:
Dynamic Data-Race Detection Through the Fine-Grained Lens. 16:1-16:23 - A. R. Balasubramanian, K. S. Thejaswini:
Adaptive Synchronisation of Pushdown Automata. 17:1-17:15 - Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf:
Decomposing Permutation Automata. 18:1-18:19 - Michele Boreale, Daniele Gorla:
Algebra and Coalgebra of Stream Products. 19:1-19:17 - Simon Foster, Chung-Kil Hur, Jim Woodcock:
Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL. 20:1-20:18 - Mayuko Kori, Ichiro Hasuo, Shin-ya Katsumata:
Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside Down. 21:1-21:22 - Muhammad Syifa'ul Mufid, Andrea Micheli, Alessandro Abate, Alessandro Cimatti:
SMT-Based Model Checking of Max-Plus Linear Systems. 22:1-22:20 - Florian Bruse, Martin Lange:
A Decidable Non-Regular Modal Fixpoint Logic. 23:1-23:18 - Raven Beutner, Bernd Finkbeiner:
A Temporal Logic for Strategic Hyperproperties. 24:1-24:19 - James C. A. Main, Mickael Randour, Jeremy Sproston:
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. 25:1-25:16 - Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Arena-Independent Finite-Memory Determinacy in Stochastic Games. 26:1-26:18 - Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis. 27:1-27:17 - Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell:
The Orbit Problem for Parametric Linear Dynamical Systems. 28:1-28:17 - Aneesh K. Shetty, S. Krishna, Georg Zetzsche:
Scope-Bounded Reachability in Valence Systems. 29:1-29:19 - Michal Ajdarów, Antonín Kucera:
Deciding Polynomial Termination Complexity for VASS Programs. 30:1-30:15 - Jan Friso Groote, Jan Martens, Erik P. de Vink:
Bisimulation by Partitioning Is Ω((m+n)log n). 31:1-31:16 - Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Explaining Behavioural Inequivalence Generically in Quasilinear Time. 32:1-32:18 - Rob van Glabbeek, Peter Höfner, Weiyou Wang:
Enabling Preserving Bisimulation Equivalence. 33:1-33:20 - Patrick Baillot, Alexis Ghyselen, Naoki Kobayashi:
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. 34:1-34:22 - Rupak Majumdar, Madhavan Mukund, Felix Stutz, Damien Zufferey:
Generalising Projection in Asynchronous Multiparty Session Types. 35:1-35:24 - Simon Fowler, Wen Kokke, Ornela Dardha, Sam Lindley, J. Garrett Morris:
Separating Sessions Smoothly. 36:1-36:18
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-25 17:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
