default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd CONCUR 2022: Warsaw, Poland
- Bartek Klin
, Slawomir Lasota, Anca Muscholl:
33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland. LIPIcs 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-246-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi:
CONCUR Test-Of-Time Award 2022 (Invited Paper). 1:1-1:3 - Philippa Gardner:
Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions (Invited Talk). 2:1-2:1 - Sergio Rajsbaum:
Distributed Decision Problems: Concurrent Specifications Beyond Binary Relations (Invited Talk). 3:1-3:13 - Jiarui Gan, Rupak Majumdar, Goran Radanovic, Adish Singla:
Sequential Decision Making With Information Asymmetry (Invited Talk). 4:1-4:18 - Wojciech Czerwinski:
Involved VASS Zoo (Invited Talk). 5:1-5:13 - Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
On the Axiomatisation of Branching Bisimulation Congruence over CCS. 6:1-6:18 - Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt:
Non-Deterministic Abstract Machines. 7:1-7:24 - Victor Khomenko, Maciej Koutny, Alex Yakovlev:
Slimming down Petri Boxes: Compact Petri Net Models of Control Flows. 8:1-8:16 - Oscar Darwin, Stefan Kiefer:
On the Sequential Probability Ratio Test in Hidden Markov Models. 9:1-9:16 - Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell:
Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications. 10:1-10:16 - Kush Grover, Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger:
Anytime Guarantees for Reachability in Uncountable Markov Decision Processes. 11:1-11:20 - Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. 12:1-12:24 - S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. 13:1-13:18 - Thomas A. Henzinger, Karoliina Lehtinen, Patrick Totzke:
History-Deterministic Timed Automata. 14:1-14:21 - Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. 15:1-15:22 - Wojciech Czerwinski, Piotr Hofman:
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable. 16:1-16:22 - A. R. Balasubramanian:
Complexity of Coverability in Depth-Bounded Processes. 17:1-17:19 - Shaull Almagor, Asaf Yeshurun:
Determinization of One-Counter Nets. 18:1-18:23 - Orna Kupferman, Naama Shamash Halevy:
Energy Games with Resource-Bounded Environments. 19:1-19:23 - Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata. 20:1-20:18 - Emmanuel Filiot, Edwin Hamel-De le Court:
Two-Player Boundedness Counter Games. 21:1-21:23 - James C. A. Main, Mickael Randour:
Different Strokes in Randomised Strategies: Revisiting Kuhn's Theorem Under Finite-Memory Assumptions. 22:1-22:18 - Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Regular Model Checking Upside-Down: An Invariant-Based Approach. 23:1-23:19 - Marius Bozga, Lucas Bueri, Radu Iosif:
On an Invariance Problem for Parameterized Concurrent Systems. 24:1-24:16 - Ira Fesefeldt, Joost-Pieter Katoen, Thomas Noll:
Towards Concurrent Quantitative Separation Logic. 25:1-25:24 - Damien Pous, Jana Wagemaker:
Completeness Theorems for Kleene Algebra with Top. 26:1-26:18 - Laura Bozzelli, Adriano Peron, César Sánchez:
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. 27:1-27:16 - Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. 28:1-28:19 - Uli Fahrenberg, Christian Johansen, Georg Struth, Krzysztof Ziemianski:
A Kleene Theorem for Higher-Dimensional Automata. 29:1-29:18 - Clément Aubert, Ross Horne, Christian Johansen:
Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus. 30:1-30:26 - Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. 31:1-31:23 - Stefan Kiefer, Qiyi Tang:
Strategies for MDP Bisimilarity Equivalence and Inequivalence. 32:1-32:22 - Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Pareto-Rational Verification. 33:1-33:20 - Shaull Almagor, Shai Guendelman:
Concurrent Games with Multiple Topologies. 34:1-34:18 - Adam D. Barwell, Alceste Scalas, Nobuko Yoshida, Fangyi Zhou:
Generalised Multiparty Session Types with Crash-Stop Failures. 35:1-35:25 - Luca Ciccone, Luca Padovani:
An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus. 36:1-36:18 - Ugo Dal Lago, Giulia Giusti:
On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments. 37:1-37: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 2024-11-15 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
