Reachability, non-termination, unboundedness and related verification problems are NP-complete for flat FIFO machines, and reachability is NP-complete for flat lossy and flat front-lossy FIFO machines.
A perfect model for bounded verification
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Verification of Flat FIFO Systems
Reachability, non-termination, unboundedness and related verification problems are NP-complete for flat FIFO machines, and reachability is NP-complete for flat lossy and flat front-lossy FIFO machines.