Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2017.42
URN: urn:nbn:de:0030-drops-83971
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8397/
Michaliszyn, Jakub ; Otop, Jan
Average Stack Cost of Büchi Pushdown Automata
| pdf-format: |
|
Abstract
We study the average stack cost of Buechi pushdown automata (Buechi PDA). We associate a non-negative price with each stack symbol and define the cost of a stack as the sum of costs of all its elements. We introduce and study the average stack cost problem (ASC), which asks whether there exists an accepting run of a given Buechi PDA such that the long-run average of stack costs is below some given threshold. The ASC problem generalises mean-payoff objective and can be use to express quantitative properties of pushdown systems. In particular, we can compute the average response time using the ASC problem. We show that the ASC problem can be solved in polynomial time.
BibTeX - Entry
@InProceedings{michaliszyn_et_al:LIPIcs:2018:8397,
author = {Jakub Michaliszyn and Jan Otop},
title = {{Average Stack Cost of B{\"u}chi Pushdown Automata}},
booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)},
pages = {42:1--42:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-055-2},
ISSN = {1868-8969},
year = {2018},
volume = {93},
editor = {Satya Lokam and R. Ramanujam},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8397},
URN = {urn:nbn:de:0030-drops-83971},
doi = {10.4230/LIPIcs.FSTTCS.2017.42},
annote = {Keywords: pushdown automata, average stack cost, weighted pushdown systems}
}
| Keywords: | pushdown automata, average stack cost, weighted pushdown systems | |
| Seminar: | 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) | |
| Issue date: | 2018 | |
| Date of publication: | 12.02.2018 |
