CONCUR 2022: 33RD INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY

This page contains an index consisting of author-provided keywords.

$
$\pi$-calculus	Complexity of Coverability in Depth-Bounded Processes
A
Abstract machines	Non-Deterministic Abstract Machines
Algorithmic game theory	Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
anytime	Anytime Guarantees for Reachability in Uncountable Markov Decision Processes
Applied pi-calculus	Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus
asynchronous automata	Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
Asynchronous hyperproperties	Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties
Asynchronous transition systems	Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus
Automata	Determinization of One-Counter Nets Two-player Boudedness Counter Games
B
bisimulation	Strategies for MDP Bisimilarity Equivalence and Inequivalence
Boolean Büchi objectives	Pareto-Rational Verification
bounded linear logic	On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments
boundedly-ambiguous	Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
burst automata	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
Büchi automata	Half-Positional Objectives Recognized by Deterministic Büchi Automata
Büchi non-emptiness problem	Checking timed Büchi automata emptiness using the local-time semantics
C
cascade product	Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
CCS	On the Axiomatisation of Branching Bisimulation Congruence over CCS
Closed languages	Completeness Theorems for Kleene Algebra with Top
cograph	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
Completeness	Completeness Theorems for Kleene Algebra with Top
complexity	On the Sequential Probability Ratio Test in Hidden Markov Models
composition	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
concurrency	Checking timed Büchi automata emptiness using the local-time semantics Towards Concurrent Quantitative Separation Logic
concurrency theory	A Kleene Theorem for Higher-Dimensional Automata
Concurrent games	Concurrent Games with Multiple Topologies
continuous	Anytime Guarantees for Reachability in Uncountable Markov Decision Processes
control flow	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
Controller Synthesis	Two-player Boudedness Counter Games
cryptography	On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments
D
Decidability	Energy Games with Resource-Bounded Environments
Decidability issues	Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties
Depth-bounded processes	Complexity of Coverability in Depth-Bounded Processes
Determinization	Determinization of One-Counter Nets
Dynamical Systems	Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications
E
edge clique cover	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
Energy games	Energy Games with Resource-Bounded Environments
Equational basis	On the Axiomatisation of Branching Bisimulation Congruence over CCS
equivalence	Strategies for MDP Bisimilarity Equivalence and Inequivalence
Event-clock automata	Simulations for Event-Clock Automata
Expressiveness issues	Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties
F
Failure Handling	Generalised Multiparty Session Types with Crash-Stop Failures
fair simulation	History-deterministic Timed Automata
fair termination	An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus
Fast-growing complexity classes	Complexity of Coverability in Depth-Bounded Processes
finite-memory strategies	Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
fixed points	An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus
G
Game theory	Two-player Boudedness Counter Games
Good-for-games	History-deterministic Timed Automata
H
half-positionality	Half-Positional Objectives Recognized by Deterministic Büchi Automata
heap-manipulation	Towards Concurrent Quantitative Separation Logic
Hidden Markov Model	On the Sequential Probability Ratio Test in Hidden Markov Models
higher-dimensional automata	A Kleene Theorem for Higher-Dimensional Automata
History-determinism	History-deterministic Timed Automata
Hyperproperties	Weak Progressive Forward Simulation is Necessary and Sufficient for Strong Observational Refinement
Hypotheses	Completeness Theorems for Kleene Algebra with Top
I
Infinite-state systems	Energy Games with Resource-Bounded Environments
interface graph	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
interval posets	A Kleene Theorem for Higher-Dimensional Automata
invariant checking	On an Invariance Problem for Parameterized Concurrent Systems
invariants	Regular Model Checking Upside-Down: An Invariant-Based Approach
K
Kleene algebra	Completeness Theorems for Kleene Algebra with Top
Kleene theorem	A Kleene Theorem for Higher-Dimensional Automata
Krohn Rhodes theorem	Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
kw1	Deriving Bisimulation Congruences for Reactive Systems (CONCUR 2000) The Impressive Power of Stopwatches (CONCUR 2000) The Element of Surprise in Timed Games (CONCUR 2003)
kw2	Deriving Bisimulation Congruences for Reactive Systems (CONCUR 2000) The Impressive Power of Stopwatches (CONCUR 2000) The Element of Surprise in Timed Games (CONCUR 2003)
kw3	Deriving Bisimulation Congruences for Reactive Systems (CONCUR 2000) The Impressive Power of Stopwatches (CONCUR 2000) The Element of Surprise in Timed Games (CONCUR 2003)
L
labelled precube categories	A Kleene Theorem for Higher-Dimensional Automata
lambda-calculus	Non-Deterministic Abstract Machines
language equivalence	Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
language inclusion	Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
linear logic	An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus
linear π-calculus	An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus
local construction	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
Local-time semantics	Checking timed Büchi automata emptiness using the local-time semantics
Lyapunov exponent	On the Sequential Probability Ratio Test in Hidden Markov Models
M
Markov chains	On the Sequential Probability Ratio Test in Hidden Markov Models Strategies for MDP Bisimilarity Equivalence and Inequivalence
markov decision process	Anytime Guarantees for Reachability in Uncountable Markov Decision Processes
Markov decision processes	Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
Mazurkiewicz traces	Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
MDPs	Strategies for MDP Bisimilarity Equivalence and Inequivalence
memoryless optimal strategies	Half-Positional Objectives Recognized by Deterministic Büchi Automata
Model checking	Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties Generalised Multiparty Session Types with Crash-Stop Failures
Model-checking	Pareto-Rational Verification
N
Nash Equilibrium	Concurrent Games with Multiple Topologies
Networks of timed automata	Checking timed Büchi automata emptiness using the local-time semantics
Nondeterministic Moore machines	Pareto-Rational Verification
O
omega-regularity	Half-Positional Objectives Recognized by Deterministic Büchi Automata
One-Counter Net	Determinization of One-Counter Nets
P
Parallel composition	On the Axiomatisation of Branching Bisimulation Congruence over CCS
Parameter Synthesis	Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications
parameterized verification	On an Invariance Problem for Parameterized Concurrent Systems Regular Model Checking Upside-Down: An Invariant-Based Approach
Parametric Markov chains	Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications
Pareto-optimality	Pareto-Rational Verification
Parity objectives	Pareto-Rational Verification
Partial information	Concurrent Games with Multiple Topologies
Petri box	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
Petri net	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
pointers	Towards Concurrent Quantitative Separation Logic
probabilistic polynomial time	On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments
process calculi	Non-Deterministic Abstract Machines
Process Calculus (pi-calculus)	Generalised Multiparty Session Types with Crash-Stop Failures
Processes	Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus
propositional dynamic logic	Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
R
randomised strategies	Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
randomization	Towards Concurrent Quantitative Separation Logic
Rational verification	Pareto-Rational Verification
reachability	Simulations for Event-Clock Automata Anytime Guarantees for Reachability in Uncountable Markov Decision Processes
reconfigurable systems	On an Invariance Problem for Parameterized Concurrent Systems
regular model-checking	Regular Model Checking Upside-Down: An Invariant-Based Approach
regular trace languages	Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
regular transition systems	Regular Model Checking Upside-Down: An Invariant-Based Approach
resource logics	On an Invariance Problem for Parameterized Concurrent Systems
S
Security	Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus
Semilinear	Determinization of One-Counter Nets
separation logic	Towards Concurrent Quantitative Separation Logic
Sequential Probability Ratio Test	On the Sequential Probability Ratio Test in Hidden Markov Models
Session types	On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments Generalised Multiparty Session Types with Crash-Stop Failures
simulations	Simulations for Event-Clock Automata
static construction	Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows
stochastic games	Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
Strong linearizability	Weak Progressive Forward Simulation is Necessary and Sufficient for Strong Observational Refinement
Strong observational refinement	Weak Progressive Forward Simulation is Necessary and Sufficient for Strong Observational Refinement
Structural operational semantics	Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus
Symmetry	Concurrent Games with Multiple Topologies
Synthesis	Energy Games with Resource-Bounded Environments History-deterministic Timed Automata
T
tba1	Reachability in Vector Addition Systems by Examples Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions Sequential Decision Making with Information Asymmetry Distributed Decision Problems: Concurrent Specifications beyond Binary Relations Approximate symbolic model checking of continuous-time Markov chains (CONCUR 1999)
tba2	Reachability in Vector Addition Systems by Examples Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions Sequential Decision Making with Information Asymmetry Distributed Decision Problems: Concurrent Specifications beyond Binary Relations Approximate symbolic model checking of continuous-time Markov chains (CONCUR 1999)
tba3	Reachability in Vector Addition Systems by Examples Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions Sequential Decision Making with Information Asymmetry Distributed Decision Problems: Concurrent Specifications beyond Binary Relations Approximate symbolic model checking of continuous-time Markov chains (CONCUR 1999)
Temporal logics for hyperproperties	Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties
Timed automata	History-deterministic Timed Automata Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
traps	Regular Model Checking Upside-Down: An Invariant-Based Approach
tree automata	On an Invariance Problem for Parameterized Concurrent Systems
two-player games on graphs	Half-Positional Objectives Recognized by Deterministic Büchi Automata Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
Type System	Generalised Multiparty Session Types with Crash-Stop Failures
U
unambiguous	Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
uncountable	Anytime Guarantees for Reachability in Uncountable Markov Decision Processes
undecidable	Anytime Guarantees for Reachability in Uncountable Markov Decision Processes
V
Vector Addition System	Determinization of One-Counter Nets
vector addition systems	Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
verification	Simulations for Event-Clock Automata
W
Weak progressive forward simulation	Weak Progressive Forward Simulation is Necessary and Sufficient for Strong Observational Refinement
Weak semantics	On the Axiomatisation of Branching Bisimulation Congruence over CCS
Weighted timed games	Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
Z
zones	Simulations for Event-Clock Automata
Zones and abstractions	Checking timed Büchi automata emptiness using the local-time semantics

Disclaimer | Powered by EasyChair Smart Program