The Covering and Boundedness Problems for Vector Addition Systems.

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

Type

Journal article

Intellectual base

Primary research

Year

1978

Pages

223-231

ISSN

0304-3975

DOI

10.1016/0304-3975(78)90036-1

DOI registrant

Elsevier

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:0a97a54a5e60 · see in the full table