Document Open Access Logo

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

Authors Hongfei Fu, Joost-Pieter Katoen



PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2011.445.pdf
  • Filesize: 420 kB
  • 12 pages

Document Identifiers

Author Details

Hongfei Fu
Joost-Pieter Katoen

Cite AsGet BibTex

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)
https://doi.org/10.4230/LIPIcs.FSTTCS.2011.445

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.
Keywords
  • infinite-state systems
  • probabilistic simulation
  • probabilistic pushdown automata

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail