Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach

Authors:
Moshe Y. Vardi
Affiliations:
-
Venue:
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Year:
1999

Citing 32
Cited 6

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fairness

Fairness
Avoiding the state explosion problem in temporal logic model checking

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On &ohgr;-automata and temporal logic

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Introduction to algorithms

Introduction to algorithms
Markov decision processes and regular events

Proceedings of the seventeenth international colloquium on Automata, languages and programming
On the development of reactive systems

Logics and models of concurrent systems
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Progress measures for complementation of &ohgr;-automata with applications to temporal logic

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Memory-efficient algorithms for the verification of temporal properties

Formal Methods in System Design - Special issue on computer-aided verification: general methods
Reasoning about infinite computations

Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
The complexity of probabilistic verification

Journal of the ACM (JACM)
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Automatic verification of liveness properties of randomized systems

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Checking that finite state concurrent programs satisfy their linear specification

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Termination of Probabilistic Concurrent Program

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finite State Markovian Decision Processes

Finite State Markovian Decision Processes
On the Relation of Programs and Computations to Models of Temporal Logic

Temporal Logic in Specification
Specification and verification of concurrent systems in CESAR

Proceedings of the 5th Colloquium on International Symposium on Programming
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Automata, Tableaux and Temporal Logics (Extended Abstract)

Proceedings of the Conference on Logic of Programs
Verification Tools for Finite-State Concurrent Systems

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Weak Alternating Automata Are Not That Weak

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Automatic verification of probabilistic concurrent finite state programs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Theories of automata on ω-tapes: A simplified approach

Journal of Computer and System Sciences

Possibilistic and Probabilistic Abstraction-Based Model Checking

PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Experiments with deterministic ω-automata for formulas of linear temporal logic

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Synthesizing probabilistic composers

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Approximate Verification of the Symbolic Dynamics of Markov Chains

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Typical Paths of a Graph

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Model checking stochastic branching processes

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.