Projections of vector addition system reachability sets are semilinear

DOI10.1016/0304-3975(89)90055-8MaRDI QIDQ1823697zbMATHOpenAlexFDO

Authors Hans Kleine Büning, Theodor Lettmann, 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)

Recommendations

• scientific article; zbMATH DE number 4092784
• scientific article; zbMATH DE number 3878366
• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
• scientific article; zbMATH DE number 3928356
• Reachability in two-dimensional vector addition systems with states is PSPACE-complete

Cites work

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

Cited in

(4)

• Petri net algorithms in the theory of matrix grammars
• Reachability in Petri nets with inhibitor arcs
• scientific article; zbMATH DE number 7559502 (Why is no real title available?)
• Separability of reachability sets of vector addition systems

This page was built for publication: Projections of vector addition system reachability sets are semilinear

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823697)