DROPS

Document

DOI: 10.4230/LIPIcs.FSTTCS.2011.445

Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems

Authors: Hongfei Fu and Joost-Pieter Katoen

Published in: LIPIcs, Volume 13, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)

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 EXPTIME-complete 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.

Cite as

Hongfei Fu and Joost-Pieter Katoen. Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, pp. 445-456, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{fu_et_al:LIPIcs.FSTTCS.2011.445,
  author =	{Fu, Hongfei and Katoen, Joost-Pieter},
  title =	{{Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
  pages =	{445--456},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-34-7},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{13},
  editor =	{Chakraborty, Supratik and Kumar, Amit},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.445},
  URN =		{urn:nbn:de:0030-drops-33435},
  doi =		{10.4230/LIPIcs.FSTTCS.2011.445},
  annote =	{Keywords: infinite-state systems, probabilistic simulation, probabilistic pushdown automata}
}

Search Results

Documents authored by Fu, Hongfei

Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems

Abstract

Cite as

Thanks for your feedback!

Could not send message