Zero-reachability in probabilistic multi-counter automata

DOI10.1145/2603088.2603161zbMath1401.68151arXiv1401.6840OpenAlexW2122843152WikidataQ57800938 ScholiaQ57800938MaRDI QIDQ4635605

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

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainsreachabilitymulti-counter automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) 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)

Ratio and Weight Quantiles ⋮ On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS ⋮ Probabilistic total store ordering ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp

This page was built for publication: Zero-reachability in probabilistic multi-counter automata