About: Bisimilarity of Probabilistic Pushdown Automata

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Bisimilarity of Probabilistic Pushdown Automata Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://drops.dagstuhl.de/opus/volltexte/2012/3880/
Description	We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without epsilon-transitions). Our first contribution is a general construction that reduces checking bisimilarity of probabilistic transition systems to checking bisimilarity of non-deterministic transition systems. This construction directly yields decidability of bisimilarity for pPDA, as well as an elementary upper bound for the bisimilarity problem on the subclass of probabilistic basic process algebras, i.e., single-state pPDA. We further show that, with careful analysis, the general reduction can be used to prove an EXPTIME upper bound for bisimilarity of probabilistic visibly pushdown automata. Here we also provide a matching lower bound, establishing EXPTIME-completeness. Finally we prove that deciding bisimilarity of probabilistic one-counter automata, another subclass of pPDA, is PSPACE-complete. Here we use a more specialised argument to obtain optimal complexity bounds. We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without epsilon-transitions). Our first contribution is a general construction that reduces checking bisimilarity of probabilistic transition systems to checking bisimilarity of non-deterministic transition systems. This construction directly yields decidability of bisimilarity for pPDA, as well as an elementary upper bound for the bisimilarity problem on the subclass of probabilistic basic process algebras, i.e., single-state pPDA. We further show that, with careful analysis, the general reduction can be used to prove an EXPTIME upper bound for bisimilarity of probabilistic visibly pushdown automata. Here we also provide a matching lower bound, establishing EXPTIME-completeness. Finally we prove that deciding bisimilarity of probabilistic one-counter automata, another subclass of pPDA, is PSPACE-complete. Here we use a more specialised argument to obtain optimal complexity bounds. (en)
Title	Bisimilarity of Probabilistic Pushdown Automata Bisimilarity of Probabilistic Pushdown Automata (en)
skos:prefLabel	Bisimilarity of Probabilistic Pushdown Automata Bisimilarity of Probabilistic Pushdown Automata (en)
skos:notation	RIV/61989100:27240/12:86084986!RIV13-GA0-27240___
http://linked.open...avai/predkladatel	Fakulta elektrotechniky a informatiky
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GAP202/11/0340), P(LA09016)
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Jančar, Petr
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	125220
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/12:86084986
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	pushdown automata; probabilistic systems; bisimilarity (en)
http://linked.open.../riv/klicoveSlovo	bisimilarity pushdown automata probabilistic systems
http://linked.open...ontrolniKodProRIV	[5474D823967A]
http://linked.open...v/mistoKonaniAkce	Hyderabad
http://linked.open...i/riv/mistoVydani	Wadern
http://linked.open...i/riv/nazevZdroje	IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Modelling and verification of parallel systems Czech Republic membership in the European Research Consortium for Informatics and Mathematics (ERCIM)
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Forejt, Vojtěch Kiefer, Stefan Jančar, Petr Worrell, James
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2012-12-15 (xsd:date)
issn	1868-8969
number of pages	13 (xsd:int)
http://bibframe.org/vocab/doi	10.4230/LIPIcs.FSTTCS.2012.448
http://purl.org/ne...btex#hasPublisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
https://schema.org/isbn	978-3-939897-47-7
http://localhost/t...ganizacniJednotka	27240
is http://linked.open...avai/riv/vysledek of	Bisimilarity of Probabilistic Pushdown Automata

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software