About: Model Checking 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)

AttributesValues
rdf:type
Description
  • We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model checking for this class of properties and pPDA is decidable. Then we show that model checking for the qualitative fragment of the logic PCTL and pPDA is also decidable. Moreover, we develop an error-tolerant model checking algorithm for general PCTL and the subclass of stateless pPDA. Finally, we consider the class of properties definable by deterministic Buchi automata, and show that both qualitative and quantitative model checking for pPDA is decidable.
  • We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model checking for this class of properties and pPDA is decidable. Then we show that model checking for the qualitative fragment of the logic PCTL and pPDA is also decidable. Moreover, we develop an error-tolerant model checking algorithm for general PCTL and the subclass of stateless pPDA. Finally, we consider the class of properties definable by deterministic Buchi automata, and show that both qualitative and quantitative model checking for pPDA is decidable. (en)
  • V práci je rozebrána problematika automatického ověřování platnosti formulí temporálních logik pro procesy pravděpodobnostních zásobníkových automatů. Nejprve je uvažována třída vlastností, která je formulovatelná jako zobecněný problém náhodné procházky. Je dokázáno, že kvalitativní i kvantitativní varianta tohoto problému je rozhodnutelná. Pak je dokázána rozhodnutelnost problému platnosti dané formule kvalitativního fragmentu logiky PCTL pro daný zásobníkový proces. Jsou také uvažovány vlastnosti popsatelné pomocí deterministických Buchiho automatů a ukázána rozhodnutelnost příslušných problémů. (cs)
Title
  • Model Checking Probabilistic Pushdown Automata
  • Ověřování platnosti formulí temporálních logik pro procesy zásobníkových automatů (cs)
  • Model Checking Probabilistic Pushdown Automata (en)
skos:prefLabel
  • Model Checking Probabilistic Pushdown Automata
  • Ověřování platnosti formulí temporálních logik pro procesy zásobníkových automatů (cs)
  • Model Checking Probabilistic Pushdown Automata (en)
skos:notation
  • RIV/00216224:14330/04:00010191!RIV08-MSM-14330___
http://linked.open.../vavai/riv/strany
  • 12-21
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/03/1161), Z(MSM 143300001)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 573885
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/04:00010191
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Probabilistic Pushdown Automata; Model Checking (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [0DBBB39EEB48]
http://linked.open...v/mistoKonaniAkce
  • Turku, Finland
http://linked.open...i/riv/mistoVydani
  • Los Alamitos (California)
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004)
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kučera, Antonín
  • Mayr, Richard
  • Esparza, Javier
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE Computer Society
https://schema.org/isbn
  • 0-7695-2192-4
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software