Vector addition systems with states (VASS) are a popular model for concu...
We study first-order logic (FO) over the structure consisting of finite ...
Automatic structures are infinite structures that are finitely represent...
Thread pooling is a common programming idiom in which a fixed set of wor...
The model of asynchronous programming arises in many contexts, from low-...
Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical...
We study context-bounded verification of liveness properties of
multi-th...
We study the problem of regular separability of languages of vector addi...
We consider extensions of monadic second order logic over ω-words,
which...
We prove new complexity results for computational problems in certain wr...
The problem of regular separability asks, given two languages K and
L, w...
We consider a language together with the subword relation, the cover
rel...
We study valence systems, finite-control programs over infinite-state
me...
This work studies which storage mechanisms in automata permit decidabili...