Long-Run Average Behaviour of Probabilistic Vector Addition Systems

DOI10.1109/LICS.2015.15zbMath1392.68284arXiv1505.02655OpenAlexW1580897786MaRDI QIDQ4635790

Stefan Kiefer, Petr Novotný, Tomáš Brázdil, Antonín Kučera

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitystochastic processesPetri netsvectorsprobabilit

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS ⋮ Long-Run Average Behavior of Vector Addition Systems with States ⋮ Qualitative Analysis of VASS-Induced MDPs ⋮ Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States

This page was built for publication: Long-Run Average Behaviour of Probabilistic Vector Addition Systems