Population protocols form a well-established model of computation of
pas...
Constant-rate multi-mode systems (MMS) are hybrid systems with finitely ...
Leroux has proved that unreachability in Petri nets can be witnessed by ...
Workflow nets are a well-established mathematical formalism for the anal...
Workflow nets are a popular variant of Petri nets that allow for algorit...
We study the reachability problem for continuous one-counter automata, C...
Numerous tasks in program analysis and synthesis reduce to deciding
reac...
We present a sound and complete method for the verification of qualitati...
Angluin et al. proved that population protocols compute exactly the
pred...
We study the reachability problem for affine Z-VASS, which are
integer v...
We give a trichotomy on the complexity of integer reachability in vector...
Population protocols are a formal model of computation by identical,
ano...
Population protocols are a formal model of sensor networks consisting of...
Population protocols are a well established model of distributed computa...
This paper is a sequel of "Forward Analysis for WSTS, Part I: Completion...