Projections of vector addition system reachability sets are semilinear

DOI10.1016/0304-3975(89)90055-8zbMath0681.68080OpenAlexW2092145843MaRDI QIDQ1823697

Theodor Lettmann, Hans Kleine Büning, Ernst W. Mayr

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90055-8

zbMATH Keywords

reachability problemVector Addition Systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Petri net algorithms in the theory of matrix grammars, Unnamed Item, Reachability in Petri Nets with Inhibitor Arcs

Cites Work

• On the reachability problem for 5-dimensional vector addition systems
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Parallel program schemata
• An Algorithm for the General Petri Net Reachability Problem