CONCUR20: CONCUR 2020: 31ST INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY

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

A
abstract interpretation	Decidability and Synthesis of Abstract Inductive Invariants Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
accuracy	On Privacy and Accuracy in Data Releases
actors	Scalable Termination Detection for Distributed Actor Systems
Algebraic invariants	Algebraic Invariants for Linear Hybrid Automata
Algorithm	A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
Algorithmic game theory	Reaching Your Goal Optimally by Playing at Random
Asynchronous Automata	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
Asynchrony	On the Representation of References in the Pi-calculus
Automata	Propositional Dynamic Logic for Hyperproperties
axiomatisation	Canonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations Partially Observable Concurrent Kleene Algebra Reactive Bisimulation Semantics for a Process Algebra with Time-outs
axiomatization	On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
Axiomatizations	Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
B
behavioural distance	Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Bidding games	A Survey of Bidding Games on Graphs
Binary relations	Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
bisimilarity	Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
bisimulation	Canonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions On the Representation of References in the Pi-calculus How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
bisimulation semantics	Reactive Bisimulation Semantics for a Process Algebra with Time-outs
Branching bisimulation	A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
C
Cascade Product	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
causality	A general approach to derive uncontrolled reversible semantics
CCSP	Reactive Bisimulation Semantics for a Process Algebra with Time-outs
circular proofs	Session Subtyping and Multiparty Compatibility using Circular Sequents
closure	Residual Nominal Automata
co-induction	Session Subtyping and Multiparty Compatibility using Circular Sequents
coalgebra	Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
complete lattices	Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
completeness	Partially Observable Concurrent Kleene Algebra
computability	Synthesis of Computable Regular Functions of Infinite Words
computational effects	Monads and Quantitative Equational Theories for Nondeterminism and Probability
concurrency	Scalable Termination Detection for Distributed Actor Systems
Concurrency theory	A Classification of Weak Asynchronous Models of Distributed Computing
Concurrent Kleene algebra	Partially Observable Concurrent Kleene Algebra
Configuration structures	How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
congruence	Canonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations
consensus problem	Characterizing consensus in the Heard-Of model
continuity	Synthesis of Computable Regular Functions of Infinite Words
convex sets of distributions monad	Monads and Quantitative Equational Theories for Nondeterminism and Probability
Counter machine	Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free
counter machines	Bounded Reachability Problems are Decidable in FIFO Machines
Cut-off for reachability	Deciding the existence of cut-off in parameterized rendez-vous networks
Cutpoint isolation problem	Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs
D
data releases	On Privacy and Accuracy in Data Releases
deadlock freedom	Probabilistic Analysis of Binary Sessions
decidability	Residual Nominal Automata
derivative language	Residual Nominal Automata
deterministic membership problem	Determinizability of one-clock timed automata
deterministic timed automata	Determinizability of one-clock timed automata
Distributed and reversible computation	How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
distributed systems	Scalable Termination Detection for Distributed Actor Systems
E
Equational theories	Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
Erlang	A general approach to derive uncontrolled reversible semantics
exact learning	Residual Nominal Automata
F
FIFO machines	Bounded Reachability Problems are Decidable in FIFO Machines
finite-memory determinacy	Games Where You Can Play Optimally with Arena-Independent Finite Memory
fixpoint equation systems	Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
Flattability	Flatness and Complexity of Immediate Observation Petri Nets
Formal semantics	How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
Formal Verification	Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free Safe Reinforcement Learning using Probabilistic Shields
G
Game theory	Modern Applications of Game-Theoretic Principles
garbage collection	Scalable Termination Detection for Distributed Actor Systems
Graph homomorphisms	Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
Graph properties	A Classification of Weak Asynchronous Models of Distributed Computing
guarded expression	Canonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations
H
Heard-Of model	Characterizing consensus in the Heard-Of model
Hybrid automata	Algebraic Invariants for Linear Hybrid Automata
Hyperlogics	Propositional Dynamic Logic for Hyperproperties
Hyperproperties	Propositional Dynamic Logic for Hyperproperties
I
Ideal Completions for WSTS	Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions
Imperative programming	On the Representation of References in the Pi-calculus
Inductive invariant	Decidability and Synthesis of Abstract Inductive Invariants
Infinite-state system	Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free
Infinite-state Verification	Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions
K
Kleene algebra with tests	Partially Observable Concurrent Kleene Algebra
Krohn Rhodes Decomposition	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
L
labelled Markov chains	The Big-O Problem for Labelled Markov Chains and Weighted Automata
labelled transition systems	Reactive Bisimulation Semantics for a Process Algebra with Time-outs
lattice theory	Residual Nominal Automata
lax extension	Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Letter-bounded context-free languages	Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs
Levy's zero-one law	Strategy Complexity of Parity Objectives in Countable MDPs
linear logic	Session Subtyping and Multiparty Compatibility using Circular Sequents
linear time-branching time spectrum	On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
M
machine learning	Modern Applications of Game-Theoretic Principles
Markov chain	A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
Markov Decision Process	Monte Carlo Tree Search guided by Symbolic Advice for MDPs Safe Reinforcement Learning using Probabilistic Shields
Markov decision processes	Strategy Complexity of Parity Objectives in Countable MDPs
Mazurkiewicz traces	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
mean-payoff	Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States A Survey of Bidding Games on Graphs
memoryless determinacy	Games Where You Can Play Optimally with Arena-Independent Finite Memory
metrics	Monads and Quantitative Equational Theories for Nondeterminism and Probability
modal logic	Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Model Checking	Propositional Dynamic Logic for Hyperproperties Safe Reinforcement Learning using Probabilistic Shields
Model-free reinforcement learning	Model-Free Reinforcement Learning for Stochastic Parity Games
Models of distributed computing	A Classification of Weak Asynchronous Models of Distributed Computing
Monte Carlo tree search	Monte Carlo Tree Search guided by Symbolic Advice for MDPs
mu-calculus	Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
multi push down	On the Separability Problem of String Constraints
multi-dimension	Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States
multiparty compatibility	Session Subtyping and Multiparty Compatibility using Circular Sequents
N
nominal automata	Residual Nominal Automata
nondeterminism	Monads and Quantitative Equational Theories for Nondeterminism and Probability
O
observations	Partially Observable Concurrent Kleene Algebra
One-Counter Automata	Parametrized Universality Problems for One-Counter Nets
optimal strategies	Games Where You Can Play Optimally with Arena-Independent Finite Memory
P
parallel composition	On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
Parameterized Verification	Deciding the existence of cut-off in parameterized rendez-vous networks Flatness and Complexity of Immediate Observation Petri Nets
parity	A Survey of Bidding Games on Graphs
parity games	Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations Model-Free Reinforcement Learning for Stochastic Parity Games
parity objectives	Strategy Complexity of Parity Objectives in Countable MDPs
Petri nets	Flatness and Complexity of Immediate Observation Petri Nets Reachability in fixed dimension vector addition systems with states
Polynomial programs	On Ranking Function Synthesis and Termination for Polynomial Programs
Polynomial ranking functions	On Ranking Function Synthesis and Termination for Polynomial Programs
poorman bidding	A Survey of Bidding Games on Graphs
privacy	On Privacy and Accuracy in Data Releases Modern Applications of Game-Theoretic Principles
probabilistic choices	Probabilistic Analysis of Binary Sessions
Probabilistic finite automata	Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs
probabilities	Monads and Quantitative Equational Theories for Nondeterminism and Probability
Process algebra	Reactive Bisimulation Semantics for a Process Algebra with Time-outs
Process algebras and calculi	How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
Process calculus	On the Representation of References in the Pi-calculus
Program verification	Decidability and Synthesis of Abstract Inductive Invariants
proof theory	Session Subtyping and Multiparty Compatibility using Circular Sequents
Q
quantitative equational theories	Monads and Quantitative Equational Theories for Nondeterminism and Probability
R
Randomisation	Reaching Your Goal Optimally by Playing at Random
Reachability	Bounded Reachability Problems are Decidable in FIFO Machines Coverability in 1-VASS with Disequality Tests
Reachability Analysis	Flatness and Complexity of Immediate Observation Petri Nets
Reachability games	Model-Free Reinforcement Learning for Stochastic Parity Games
Reachability problem	Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free Reachability in fixed dimension vector addition systems with states
reactive systems	Reactive Bisimulation Semantics for a Process Algebra with Time-outs
recursion	Reactive Bisimulation Semantics for a Process Algebra with Time-outs
References	On the Representation of References in the Pi-calculus
Refinement types	Session Types with Arithmetic Refinements
regular functiona	Synthesis of Computable Regular Functions of Infinite Words
Relation algebras	Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
Rendez-vous Networks	Deciding the existence of cut-off in parameterized rendez-vous networks
residual automata	Residual Nominal Automata
Reversible CCS	How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
reversible computing	A general approach to derive uncontrolled reversible semantics
Richman bidding	A Survey of Bidding Games on Graphs
Robustness	Weighted Transducers for Robustness Verification
S
Safe Exploration	Safe Reinforcement Learning using Probabilistic Shields
Safe Reinforcement Learning	Safe Reinforcement Learning using Probabilistic Shields
Safety	Algebraic Invariants for Linear Hybrid Automata
security	Modern Applications of Game-Theoretic Principles
Security Protocols	Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions
Semi-algebraic sets	On Ranking Function Synthesis and Termination for Polynomial Programs
separability	On the Separability Problem of String Constraints
sequent calculus	Session Subtyping and Multiparty Compatibility using Circular Sequents
session types	Probabilistic Analysis of Binary Sessions Session Types with Arithmetic Refinements Session Subtyping and Multiparty Compatibility using Circular Sequents
simulation	Monte Carlo Tree Search guided by Symbolic Advice for MDPs
soundness and completeness	Canonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations
static analysis	Probabilistic Analysis of Binary Sessions
Stochastic games	Model-Free Reinforcement Learning for Stochastic Parity Games
straight line	On the Separability Problem of String Constraints
string constraints	On the Separability Problem of String Constraints
subtyping	Session Subtyping and Multiparty Compatibility using Circular Sequents
symbolic advice	Monte Carlo Tree Search guided by Symbolic Advice for MDPs
T
Temporal Logic over traces	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces
termination detection	Scalable Termination Detection for Distributed Actor Systems
time-outs	Reactive Bisimulation Semantics for a Process Algebra with Time-outs
timed automata	Determinizability of one-clock timed automata
Top	Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
total variation distances	The Big-O Problem for Labelled Markov Chains and Weighted Automata
transducers	Synthesis of Computable Regular Functions of Infinite Words On the Separability Problem of String Constraints
two-player games on graphs	Games Where You Can Play Optimally with Arena-Independent Finite Memory
Type equality	Session Types with Arithmetic Refinements
type theory	Session Subtyping and Multiparty Compatibility using Circular Sequents
U
unambiguity	Universality Problem for Unambiguous VASS
underapproximation	Bounded Reachability Problems are Decidable in FIFO Machines
Unit	Non axiomatizability of positive relation algebras with constants, via graph homomorphisms
universality	Universality Problem for Unambiguous VASS Parametrized Universality Problems for One-Counter Nets
up-to techniques	Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations
V
Vector Addidtion Systems	Parametrized Universality Problems for One-Counter Nets
Vector addition system	Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free
vector addition systems	Universality Problem for Unambiguous VASS Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States Reachability in fixed dimension vector addition systems with states
Vector addition systems with states	Coverability in 1-VASS with Disequality Tests
verification	Bounded Reachability Problems are Decidable in FIFO Machines Weighted Transducers for Robustness Verification Characterizing consensus in the Heard-Of model
W
Weak bisimulation	A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains
weighted automata	The Big-O Problem for Labelled Markov Chains and Weighted Automata
Weighted games	Reaching Your Goal Optimally by Playing at Random
Weighted graphs	Coverability in 1-VASS with Disequality Tests
Weighted transducers	Weighted Transducers for Robustness Verification
Wreath Product	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces

Disclaimer | Powered by EasyChair Smart Program