Moshe Y. Vardi  Home/Search
Context Related
| rice.edu/~vardi/papers/arts99.ps.gz Cached: 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.
PS.gz PS Image Update HelpFrom: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We describe the automata-theoretic approach to the algorithmic verification of probabilistic finite-state systems with respect to linear-time properties. The basic idea underlying this approach is that for any linear temporal formula we can construct an automaton that accepts precisely the computations that satisfy the formula. This enables the reduction of probabilistic model checking to ergodic analysis of Markov chains. 1 Introduction Temporal logics, which are modal logics geared towards ... (Update)
Similar documents based on text: More All
0.1: An Automata-Theoretic Approach to Reasoning about.. - Kupferman, Vardi (2000) (Correct)
0.1: An Automata-Theoretic Approach to Branching-Time Model.. - Bernholtz, al. (1994) (Correct)
0.1: Model Checking LTL using Constraint Programming - Esparza, Melzer (1997) (Correct)
Related documents from co-citation: More All
5: Model Checking - Clarke, Grumberg et al. - 1994
5: The complexity of probabilistic verification (context) - Courcoubetis, Yannakakis - 1995
5: Model checking of probabilistic and nondeterministic systems - Bianco, de Alfaro - 1995
BibTeX entry: (Update)
M. Vardi. Probabilistic linear-time model checking: An overview of the automatatheoretic approach. In J.-P. Katoen, editor, Proceedings, ARTS'99, volume 1601 of Lecture Notes in Computer Science, pages 265-276. Springer-Verlag, 1999. 7 http://citeseer.ist.psu.edu/vardi99probabilistic.html More
@article{ vardi99probabilistic,
author = "Moshe Y. Vardi",
title = "Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach",
journal = "Lecture Notes in Computer Science",
volume = "1601",
pages = "265--276",
year = "1999",
url = "citeseer.ist.psu.edu/vardi99probabilistic.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
539 The temporal logic of programs (context) - Pnueli - 1977
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
397 Design and synthesis of synchronization skeletons using bran.. (context) - Clarke, Emerson - 1981
276 Finite Markov Chains (context) - Kemeny, Snell - 1960
267 Computer Aided Verification of Coordinating Processes (context) - Kurshan - 1994
230 Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
222 The complexity of propositional linear temporal logic (context) - Sistla, Clarke - 1985
221 Specification and verification of concurrent systems in Cesa.. (context) - Queille, Sifakis - 1981
194 the development of reactive systems (context) - Harel, Pnueli - 1985
177 Temporal logic can be more expressive (context) - Wolper - 1983
163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
139 Reasoning about infinite computations - Vardi, Wolper - 1994
128 An automata-theoretic approach to linear temporal logic - Vardi - 1996
128 Automatic verification of probabilistic concurrent finite-st.. (context) - Vardi - 1985
127 An automata-theoretic approach to branching-time model check.. - Bernholtz, Vardi et al. - 1994
121 Denumerable Markov Chains (context) - Kemeny, Snell et al. - 1976
114 The temporal semantics of concurrent programs (context) - Pnueli - 1981
112 Memory efficient algorithms for the verification of temporal.. - Courcoubetis, Vardi et al. - 1992
102 Verification tools for finite-state concurrent systems - Clarke, Grumberg et al. - 1993
100 Mu-calculus and determinacy (context) - Emerson, Jutla - 1991
82 Finite-State MarkovianDecision Processes (context) - Derman - 1970
81 Handbook of Theoretical Computer Science (context) - Thomas, infinite - 1990
67 The complexity of probabilistic verification (context) - Courcoubetis, Yannakakis - 1995
64 A logic for reasoning about time and probability (context) - Hanssonand, Jonsson - 1994
59 the relation of programs and computations to models of tempo.. (context) - Wolper - 1989
53 Testing and generating infinite sequences by a finite automa.. (context) - McNaughton - 1966
47 Avoiding the state explosion problem in temporal logic model.. (context) - Clarke, Grumberg - 1987
42 tapes: A simplified approach (context) - Choueka, automata - 1974
39 Texts and Monographs in Computer Science (context) - Francez - 1986
39 Weak alternating automata are not that weak - Kupferman, Vardi - 1997
31 Markov decision processes and regular events (context) - Courcoubetis, Yannakakis - 1990
25 Protocol engineering (context) - Liu - 1989
25 and temporal logics (context) - Emerson, tableaux - 1985
21 Termination of probabilistic concurrent programs (context) - Hart, Sharir et al. - 1983
20 Complexity of automata on infinite objects - Safra - 1989
15 Complementation is more difficult with automata on infinite .. (context) - Michel - 1988
15 automata and temporal logic (context) - Safra, Vardi - 1989
14 Network protocols and tools to help produce them (context) - Rudin - 1987
13 Alternating automata and program verification - Vardi - 1995
13 Synthesis with incomplete informatio - Kupferman, Vardi - 1997
12 automata with applications to temporal logic (context) - Klarlund, for - 1991
7 Automatic verification of liveness properties of randomized .. - Baier, Kwiatowska - 1997
4 the advantage of free choice: A fully symmetric and fully di.. (context) - Lehman, Rabin - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (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