@inproceedings{10.1007/978-3-319-91268-4_10,
Abstract = {The coverability and boundedness problems are well-known exponential-space complete problems for vector addition systems with states (or Petri nets). The boundedness problem asks if the reachability set (for a given initial configuration) is finite. Here we consider a dual problem, the co-finiteness problem that asks if the complement of the reachability set is finite; by restricting the question we get the co-emptiness (or universality) problem that asks if all configurations are reachable.},
Address = {Cham},
Author = {Jan{\v{c}}ar, Petr and Leroux, J{\'e}r{\^o}me and Sutre, Gr{\'e}goire},
BookTitle = {Application and Theory of Petri Nets and Concurrency},
Editor = {Khomenko, Victor and Roux, Olivier H.},
File = {Jančar2018\_Chapter\_Co-finitenessAndCo-emptinessOf (0) - a - a - j.pdf},
ISBN = {978-3-319-91268-4},
Pages = {184--203},
Publisher = {Springer International Publishing},
Title = {Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States},
Year = {2018},
date-added = {2018-10-17 14:17:24 +0000},
date-modified = {2018-10-17 14:17:24 +0000},
doi = {10.1007/978-3-319-91268-4_10}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A