Journal article
Game characterization of probabilistic bisimilarity, and applications to pushdown automata
- Abstract:
-
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and nondeterministic branching, generalising the classical notion of pushdown automata (without epsilon-transitions). We first show a general characterization of probabilistic bisimilarity in terms of two-player games, which naturally reduces checking bisimilarity of probabilistic labelled transition systems to checking bisimilarity of standard ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Funding
+ Grant Agency of the Czech Republic
More from this funder
Funding agency for:
Forejt, V
Grant:
GACR:15-13784S
Bibliographic Details
- Publisher:
- International Federation of Computational Logic Publisher's website
- Journal:
- Logical Methods in Computer Science (LMCS) Journal website
- Volume:
- 14
- Issue:
- 4
- Article number:
- 13
- Publication date:
- 2018-11-15
- Acceptance date:
- 2018-10-08
- DOI:
- EISSN:
-
1860-5974
- ISSN:
-
1860-5974
- Source identifiers:
-
936824
Item Description
- Keywords:
- Pubs id:
-
pubs:936824
- UUID:
-
uuid:0695ce49-60d5-48fa-9159-7b3acae75dd7
- Local pid:
- pubs:936824
- Deposit date:
- 2018-11-03
Terms of use
- Copyright holder:
- Forejt, et al
- Copyright date:
- 2018
- Notes:
-
© V. Forejt, P. Jancar, S. Kiefer, and J. Worrell. This work is licensed under the Creative Commons Attribution License. To view a copy of this
license, visit https://creativecommons.org/licenses/by/4.0/ o
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record