Reachability in Vector Addition Systems is Ackermann-complete

Vector Addition Systems and equivalent Petri nets are a well established models of concurrency. The central algorithmic problem for Vector Addition Systems with a long research history is the reachability problem asking whether there exists a run from one given configuration to another. We settle it...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 1229 - 1240
Main Authors:	Czerwinski, Wojciech, Orlikowski, Lukasz
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.02.2022
Subjects:	ackermann completeness Complexity theory Computer science Concurrent computing History Petri nets reachability problem vector addition systems
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!