Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
From MaRDI portal
Publication:5089288
Recommendations
- Long-Run Average Behavior of Vector Addition Systems with States
- Long-run average behaviour of probabilistic vector addition systems
- The Reachability Problem for Two-Dimensional Vector Addition Systems with States
- scientific article; zbMATH DE number 7559504
- A multiparameter analysis of the boundedness problem for vector addition systems
- scientific article; zbMATH DE number 3917705
- The complexity of reachability in affine vector addition systems with states
- scientific article; zbMATH DE number 7407775
- Systems of vector quasi-equilibrium problems and their applications
- CONCUR 2004 - Concurrency Theory
Cites work
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 559221 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- A structure to decide reachability in Petri nets
- Average stack cost of Büchi pushdown automata
- Component-based synthesis for complex APIs
- Decidability of parameterized verification
- Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
- Efficient coverability analysis by proof minimization
- Hyperplane separation technique for multidimensional mean-payoff games
- Infinite-state energy games
- Integer vector addition systems with states
- Long-Run Average Behavior of Vector Addition Systems with States
- Long-run average behaviour of probabilistic vector addition systems
- Nested weighted limit-average automata of bounded width
- Parallel program schemata
- Polynomial vector addition systems with states
- Quantitative monitor automata
- Reachability in Succinct and Parametric One-Counter Automata
- Reachability in two-dimensional vector addition systems with states is PSPACE-complete
- The complexity of mean-payoff pushdown games
- The covering and boundedness problems for vector addition systems
- The reachability problem for Petri nets is not elementary
This page was built for publication: Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089288)