Javier Esparza, Antonín Kucera, Richard Mayr  Home/Search
Context Related
| informatik.unistu...URS200403.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unistuttgart.de/fm... (more) Homepages: J.Esparza |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Cited by: More
A Note on the Attractor-Property - Of Infinite-State Markov (Correct)
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (Correct)
Verifying Probabilistic Procedural Programs - Esparza, Etessami (2004) (Correct)
Active bibliography (related documents): More All
0.3: Symbolic Verification of Communicating Systems With.. - Baier Bertrand And (Correct)
0.3: Probabilistic Models for Reo Connector Circuits - Baier (2005) (Correct)
0.3: The Verification of Probabilistic Lossy Channel Systems - Schnoebelen (2004) (Correct)
Similar documents based on text: More All
0.7: A Logical Viewpoint on Process-Algebraic Quotients - Kucera, Esparza (1999) (Correct)
0.6: Efficient Verification Algorithms for One-Counter Processes - Kucera (2000) (Correct)
0.6: On Simulation-Checking with Sequential Systems - Kucera (2000) (Correct)
Related documents from co-citation: More All
4: A logic for reasoning about time and reliability - Hansson, Jonsson - 1994
3: Establishing Qualitative Properties for Probabilistic Lossy Channel Systems - Baier, Engelen et al. - 1999
3: An optimal automata approach to LTL model checking of probabilistic systems (context) - Couvreur, Saheb et al. - 2003
BibTeX entry: (Update)
J. Esparza, A. Kucera, and R. Mayr. Model checking probabilistic pushdown automata. Technical Report FIMU-RS2004 -03, Faculty of Informatics, Masaryk University, 2004. http://citeseer.ist.psu.edu/article/esparza04model.html More
@techreport{ esparza04model,
author = "J. Esparza and A. Kucera and R. Mayr",
title = "Model checking probabilistic pushdown automata",
number = "FIMU-RS2004-03",
institution = "Faculty of Informatics, Masaryk University",
year = "2004",
url = "citeseer.ist.psu.edu/article/esparza04model.html" }
Citations (may not include all citations):229 A Decision Method for Elementary Algebra and Geometry (context) - Tarski - 1951
87 A logic for reasoning about time and reliability - Hansson, Jonsson - 1994
49 It usually works: The temporal logic of stochastic systems - Aziz, Singhal et al. - 1995
44 Quantitative analysis and model checking - Huth, Kwiatkowska - 1997
40 Number 18 in Cambridge Tracts in Theoretical Computer Scienc.. (context) - Baeten, Weijland - 1990
35 an and M.Y. Vardi. Freedom, weakness, and determinism: From .. (context) - Kupferm - 1998
30 Information and Control (context) - Lehman, Shelah et al. - 1982
23 Analysis of recursive state machines - Alur, Etessami et al. - 2001
20 Complexity of deciding Tarski algebra (context) - Grigoriev - 1988
15 Probabilistic lossy channel systems - Iyer, Narasimha - 1997
15 Establishing qualitative properties for probabilistic lossy .. - Baier, Engelen - 1999
13 Model-checking LTL with regular valuations for pushdown syst.. - Esparza, cera et al. - 2003
11 Model checking lossy channel systems is probably decidable - Bertrand, Schnoebelen - 2003
8 Quantitative analysis of probabilistic lossy channel systems (context) - Rabinovich - 2003
7 Relating probabilistic grammars and automata - Abney, McAllester et al. - 1999
4 Model checking probabilistic pushdown automata - Esparza, cera et al. - 2004
4 An optimal automata approach to LTL model checking of probab.. (context) - Couvreur, Saheb et al. - 2003
2 Properties of probabilistic pushdown automata - Macarie, Ogihara - 1998
2 Reasoning about probabilistic channel systems (context) - Abdulla, Baier et al. - 2000
1 complexity probabilistic veriThetacation (context) - Courcoubetis, complexity et al. - 1995
1 Verifying temporal properties of \Thetanite-state probabilis.. (context) - Courcoubetis, Yannakakis - 1988
1 VeriThetacation probabilistic system with faulty communicati.. (context) - Abdulla, Thetacation et al. - 2003
1 Automatic veriThetacation probabilistic concurrent Thetanite.. (context) - Automatic, of et al. - 1985
1 EfThetacient algorithm model checking pushdown system (context) - Hansel, Schwoon et al. - 2000
1 Probabilistic temporal logic for \Thetanite and bounded mode.. (context) - Hart, Sharir - 1984
1 Model checking the full modal mu-calculus for in\Thetanite s.. (context) - Burkart, Steffen - 1997
Documents on the same site (http://www.informatik.uni-stuttgart.de/fmi/szs/publications/esparza/): More
Simple Representative Instantiations for Multicast Protocols - Esparza, Maidl (2003) (Correct)
Reachability in Live and Safe Free-Choice Petri Nets is NP-complete - Esparza (1996) (Correct)
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC