Journal article icon

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
Version:
Publisher's Version

Actions


Access Document


Files:
Publisher copy:
10.23638/LMCS-14(4:13)2018

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Oxford college:
St Johns College
ORCID:
0000-0003-4173-6877
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
More from this funder
Funding agency for:
Kiefer, S
Publisher:
International Federation of Computational Logic Publisher's website
Journal:
Logical Methods in Computer Science (LMCS) Journal website
Volume:
14
Issue:
4
Pages:
Article: 13
Publication date:
2018-11-15
Acceptance date:
2018-10-08
DOI:
EISSN:
1860-5974
ISSN:
1860-5974
Pubs id:
pubs:936824
URN:
uri:0695ce49-60d5-48fa-9159-7b3acae75dd7
UUID:
uuid:0695ce49-60d5-48fa-9159-7b3acae75dd7
Local pid:
pubs:936824

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP