Petri nets: an introduction
A multiparameter analysis of the boundedness problem for vector addition systems
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
On the Complexity of the Linear-Time mu -calculus for Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Multiset-valued linear index grammars: imposing dominance constraints on derivations
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
On Yen's Path Logic for Petri Nets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Journal of Computer and System Sciences
The reachability problem for branching vector addition systems requires doubly-exponential space
Information Processing Letters
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Well-Structured pushdown systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Expand, enlarge, and check for branching vector addition systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.