| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332908 | Journal of Computer and System Sciences | 2013 | 25 Pages |
Abstract
⺠We characterize the complexity of detection problems on vector addition systems. ⺠We consider place boundedness, regularity detection and reversal-boundedness detection. ⺠We extend Rackoffâʼs technique to obtain ExpSpace upper bound uniformly.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Stéphane Demri,