Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States

DOI10.4230/LIPIcs.CONCUR.2020.23OpenAlexW3082869212MaRDI QIDQ5089288

Krishnendu Chatterjee, Jan Otop, Thomas A. Henzinger

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2007.08917

zbMATH Keywords

probabilistic semanticsmean-payoffvector addition systemsmultidimension

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A structure to decide reachability in Petri nets
• The covering and boundedness problems for vector addition systems
• Quantitative monitor automata
• Hyperplane separation technique for multidimensional mean-payoff games
• Parallel program schemata
• Efficient Coverability Analysis by Proof Minimization
• Reachability in Succinct and Parametric One-Counter Automata
• Integer Vector Addition Systems with States
• Decidability of Parameterized Verification
• Nested Weighted Limit-Average Automata of Bounded Width
• Infinite-state energy games
• Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
• Long-Run Average Behaviour of Probabilistic Vector Addition Systems
• Quantitative Automata under Probabilistic Semantics
• The Complexity of Mean-Payoff Pushdown Games
• Average Stack Cost of Büchi Pushdown Automata
• Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
• The reachability problem for Petri nets is not elementary
• Component-based synthesis for complex APIs
• Long-Run Average Behavior of Vector Addition Systems with States

This page was built for publication: Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States