DMCA
Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (2011)
| Venue: | In FSTTCS |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Fu11decidingprobabilistic,
author = {Hongfei Fu and Joost-pieter Katoen},
title = {Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems},
booktitle = {In FSTTCS},
year = {2011},
pages = {445--456}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper studies the decidability and computational complexity of checking probabilistic simulation pre-order between probabilistic pushdown automata (pPDA) and (probabilistic) finite-state systems. We show that checking classical and combined probabilistic similarity are EXPTIMEcomplete in both directions and become polynomial if both the number of control states of the pPDA and the size of the finite-state system are fixed. These results show that checking probabilistic similarity is as hard as checking similarity in the standard, i.e., non-probabilistic setting.
