Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2014
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913919606456320 |
|---|---|
| author | Lin, Deren Lin, Tianrong |
| author_facet | Lin, Deren Lin, Tianrong |
| contents | In this communication, we resolve a longstanding open question in the probabilistic verification of infinite-state systems. We show that model checking {\it stateless probabilistic pushdown systems (pBPA)} against {\it probabilistic computational tree logic (PCTL)} is generally undecidable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1405_4806 |
| institution | arXiv |
| publishDate | 2014 |
| record_format | arxiv |
| spellingShingle | Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems Lin, Deren Lin, Tianrong Logic in Computer Science Formal Languages and Automata Theory Logic F.4.1 In this communication, we resolve a longstanding open question in the probabilistic verification of infinite-state systems. We show that model checking {\it stateless probabilistic pushdown systems (pBPA)} against {\it probabilistic computational tree logic (PCTL)} is generally undecidable. |
| title | Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems |
| topic | Logic in Computer Science Formal Languages and Automata Theory Logic F.4.1 |
| url | https://arxiv.org/abs/1405.4806 |