A decidability theorem for a class of vector-addition systems (original) (raw)

The paper presents a decidability theorem for vector addition systems (VAS), specifically focusing on conflict-free nets (CFN). It establishes that, given two states s and t within a CFN, it is decidable whether t can be reached from s. Furthermore, the work outlines a method to construct a sequence of minimal length that demonstrates this reachability. The implications of this theorem contribute significantly to the understanding and analysis of behaviors in systems modeled by vector addition systems.