Model Checking Probabilistic Pushdown Automata

Authors:
Javier Esparza;Antonin Kucera;Richard Mayr
Affiliations:
University of Stuttgart, Germany;Masaryk University, Czech Republic;Albert-Ludwigs-University Freiburg, Germany
Venue:
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Year:
2004

Citing 0
Cited 53

Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract)

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Verification of probabilistic systems with faulty communication

Information and Computation
A note on the attractor-property of infinite-state Markov chain

Information Processing Letters
Quantitative analysis of probabilistic lossy channel systems

Information and Computation
On the convergence of Newton's method for monotone systems of polynomial equations

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
CSL model checking algorithms for QBDs

Theoretical Computer Science
Reachability in recursive Markov decision processes

Information and Computation
Newton's Method for ω-Continuous Semirings

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Automata, Probability, and Recursion

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

Journal of the ACM (JACM)
Model Checking Quantitative Linear Time Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Discounted Properties of Probabilistic Pushdown Automata

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Branching-Time Model-Checking of Probabilistic Pushdown Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Sliding Window Abstraction for Infinite Markov Chains

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Methods for Quantitative Analysis of Probabilistic Pushdown Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of probabilistic systems with faulty communication

Information and Computation
Quantitative analysis of probabilistic lossy channel systems

Information and Computation
A note on the attractor-property of infinite-state Markov chains

Information Processing Letters
On fixed point equations over commutative semirings

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
PReMo: an analyzer for probabilistic recursive models

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
An extension of Newton's method to ω-continuous semirings

DLT'07 Proceedings of the 11th international conference on Developments in language theory
SDSIrep: a reputation system based on SDSI

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Stochastic games with lossy channels

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

Performance Evaluation
On least fixed points of systems of positive polynomials

ACM Communications in Computer Algebra
Newtonian program analysis

Journal of the ACM (JACM)
Space-efficient scheduling of stochastically generated tasks

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Probabilistic XML via Markov Chains

Proceedings of the VLDB Endowment
Computing the Least Fixed Point of Positive Polynomial Systems

SIAM Journal on Computing
On probabilistic parallel programs with process creation and synchronisation

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Runtime analysis of probabilistic programs with unbounded recursion

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Efficient analysis of probabilistic programs with an unbounded counter

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Carrying probabilities to the infinite world

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Space-efficient scheduling of stochastically generated tasks

Information and Computation
Efficient qualitative analysis of classes of recursive markov decision processes and simple stochastic games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Recursive concurrent stochastic games

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Recursive markov decision processes and recursive stochastic games

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Probability and recursion

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Computing the expected accumulated reward and gain for a subclass of infinite markov chains

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the decidability of temporal properties of probabilistic pushdown automata

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic verification of recursive probabilistic state machines

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying probabilistic procedural programs

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking of Recursive Probabilistic Systems

ACM Transactions on Computational Logic (TOCL)
Reachability in recursive markov decision processes

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Analysis of recursive probabilistic models

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Eager markov chains

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Consistency of stochastic context-free grammars

Mathematical and Computer Modelling: An International Journal
Survey: Equilibria, fixed points, and complexity classes

Computer Science Review
Model checking stochastic branching processes

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Determinacy and optimal strategies in infinite-state stochastic reachability games

Theoretical Computer Science
Branching-time model-checking of probabilistic pushdown automata

Journal of Computer and System Sciences
Analyzing probabilistic pushdown automata

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a concise and natural encoding of the spi-calculus into the more basic 驴-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests ...