VASS pvass parity games channels markov decision processes parameterized games Kleene algebra linear dynamical systems reachability trees game distributed networks parameterized verification weighted automata peacewise-testable languages Nash equilibria context-free grammars Petri nets neural networks Markov chains subtyping bi-reachablility XML descriptional complexity temporal logic graphs counter machines networks infinite words circuits vass communicating automata positionality population protocols valence systems automata invariants transducers coverability continuity logic Petri nets with data petri nets complexity separation first-order logic CFL cost register automata pushdown automata fixpoint session types stochastic processes two variables verification algebra languages timed automata Games on graphs pushdown Skolem problem string constraints games emptiness checking

algebra

automata

bi-reachablility

CFL

channels

circuits

communicating automata

complexity

context-free grammars

continuity

cost register automata

counter machines

coverability

descriptional complexity

distributed networks

emptiness checking

first-order logic

fixpoint

game

games

Games on graphs

graphs

infinite words

invariants

Kleene algebra

languages

linear dynamical systems

logic

Markov chains

markov decision processes

Nash equilibria

networks

neural networks

parameterized games

parameterized verification

parity games

peacewise-testable languages

petri nets

Petri nets

Petri nets with data

population protocols

positionality

pushdown

pushdown automata

pvass

reachability

separation

session types

Skolem problem

stochastic processes

string constraints

subtyping

temporal logic

timed automata

transducers

trees

two variables

valence systems

VASS

vass

verification

weighted automata

XML