Some Decision Problems Related to the Reachability Problem for Petri Nets¶

Araki, T., & Kasami, T. (1976). Some Decision Problems Related to the Reachability Problem for Petri Nets. Theoretical Computer Science, 3(1), 85-104.

Type: Journal article
Intellectual base: Primary research
Year: 1976
Volume: 3
Issue: 1
Pages: 85-104
ISSN: 0304-3975
DOI: 10.1016/0304-3975(76)90067-0
DOI registrant: Elsevier
Link: https://www.sciencedirect.com/science/article/pii/0304397576900670

Cited by¶

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Domain-specific¶

Prioritised Petri Net
- Numerical levels are one way to express the order, not an all-instance requirement.
  This sourceThe original abstract supports the one-privileged-transition generalized-net undecidability claim and treats reset transitions separately; full proof and construction pages were not independently inspected.

Verification¶

Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.

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:0b41251b6c23 · see in the full table