TALK KEYWORD INDEX

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

$ | |

$\pi$-calculus | |

A | |

Abstract machines | |

Algorithmic game theory | |

anytime | |

Applied pi-calculus | |

asynchronous automata | |

Asynchronous hyperproperties | |

Asynchronous transition systems | |

Automata | |

B | |

bisimulation | |

Boolean Büchi objectives | |

bounded linear logic | |

boundedly-ambiguous | |

burst automata | |

Büchi automata | |

Büchi non-emptiness problem | |

C | |

cascade product | |

CCS | |

Closed languages | |

cograph | |

Completeness | |

complexity | |

composition | |

concurrency | |

concurrency theory | |

Concurrent games | |

continuous | |

control flow | |

Controller Synthesis | |

cryptography | |

D | |

Decidability | |

Decidability issues | |

Depth-bounded processes | |

Determinization | |

Dynamical Systems | |

E | |

edge clique cover | |

Energy games | |

Equational basis | |

equivalence | |

Event-clock automata | |

Expressiveness issues | |

F | |

Failure Handling | |

fair simulation | |

fair termination | |

Fast-growing complexity classes | |

finite-memory strategies | |

fixed points | |

G | |

Game theory | |

Good-for-games | |

H | |

half-positionality | |

heap-manipulation | |

Hidden Markov Model | |

higher-dimensional automata | |

History-determinism | |

Hyperproperties | |

Hypotheses | |

I | |

Infinite-state systems | |

interface graph | |

interval posets | |

invariant checking | |

invariants | |

K | |

Kleene algebra | |

Kleene theorem | |

Krohn Rhodes theorem | |

kw1 | |

kw2 | |

kw3 | |

L | |

labelled precube categories | |

lambda-calculus | |

language equivalence | |

language inclusion | |

linear logic | |

linear π-calculus | |

local construction | |

Local-time semantics | |

Lyapunov exponent | |

M | |

Markov chains | |

markov decision process | |

Markov decision processes | |

Mazurkiewicz traces | |

MDPs | |

memoryless optimal strategies | |

Model checking | |

Model-checking | |

N | |

Nash Equilibrium | |

Networks of timed automata | |

Nondeterministic Moore machines | |

O | |

omega-regularity | |

One-Counter Net | |

P | |

Parallel composition | |

Parameter Synthesis | |

parameterized verification | |

Parametric Markov chains | |

Pareto-optimality | |

Parity objectives | |

Partial information | |

Petri box | |

Petri net | |

pointers | |

probabilistic polynomial time | |

process calculi | |

Process Calculus (pi-calculus) | |

Processes | |

propositional dynamic logic | |

R | |

randomised strategies | |

randomization | |

Rational verification | |

reachability | |

reconfigurable systems | |

regular model-checking | |

regular trace languages | |

regular transition systems | |

resource logics | |

S | |

Security | |

Semilinear | |

separation logic | |

Sequential Probability Ratio Test | |

Session types | |

simulations | |

static construction | |

stochastic games | |

Strong linearizability | |

Strong observational refinement | |

Structural operational semantics | |

Symmetry | |

Synthesis | |

T | |

tba1 | |

tba2 | |

tba3 | |

Temporal logics for hyperproperties | |

Timed automata | |

traps | |

tree automata | |

two-player games on graphs | |

Type System | |

U | |

unambiguous | |

uncountable | |

undecidable | |

V | |

Vector Addition System | |

vector addition systems | |

veriﬁcation | |

W | |

Weak progressive forward simulation | |

Weak semantics | |

Weighted timed games | |

Z | |

zones | |

Zones and abstractions |