The Covering and Boundedness Problems for Vector Addition Systems.

Rackoff, C. (1978). The Covering and Boundedness Problems for Vector Addition Systems. Theoretical Computer Science, 3975(78), 223-231.

Type

Journal article

Intellectual base

Primary research

Year

1978

DOI

10.1016/0304-3975(78)90036-1`

Link

https://doi.org/10.1016/0304-3975(78)90036-1`

Cited by

1 citation across 1 artifact.

Domain-specific

• Vector Addition System
  • the analysis predicate: reachability, coverability, boundedness, termination, liveness, repeated reachability, or a related property states what part of the graph matters.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:2a6f545ccaaa · see in the full table