Complexity of deciding Tarski algebra
Journal of Symbolic Computation
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The complexity of probabilistic verification
Journal of the ACM (JACM)
Probabilistic Lossy Channel Systems
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Reasoning about Probabilistic Lossy Channel Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Model Checking CTL Properties of Pushdown Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Analysis of Recursive State Machines
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Model checking LTL with regular valuations for pushdown systems
Information and Computation - TACS 2001
Model Checking Probabilistic Pushdown Automata
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Verification of probabilistic systems with faulty communication
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Model checking lossy channels systems is probably decidable
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Quantitative analysis of probabilistic lossy channel systems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
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)
Discounted Properties of Probabilistic Pushdown Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
TOP-K projection queries for probabilistic business processes
Proceedings of the 12th International Conference on Database Theory
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Methods for Quantitative Analysis of Probabilistic Pushdown Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
CSL model checking algorithms for infinite-state structured Markov chains
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
On models and query languages for probabilistic processes
ACM SIGMOD Record
Time-bounded reachability in tree-structured QBDs by abstraction
Performance Evaluation
Computing the Least Fixed Point of Positive Polynomial Systems
SIAM Journal on Computing
Efficient analysis of probabilistic programs with an unbounded counter
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
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
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
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
Model checking probabilistic systems against pushdown specifications
Information Processing Letters
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
Strategy synthesis for markov decision processes and branching-time logics
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Analyzing probabilistic pushdown automata
Formal Methods in System Design
| Hi-index | 0.00 |
We consider qualitative and quantitative model-checking problems for probabilistic pushdown automata (pPDA) and various temporal logics. We prove that the qualitative and quantitative model-checking problem for ω-regular properties and pPDA is in 2-EXPSPACE and 3-EXPTIME, respectively. We also prove that model-checking the qualitative fragment of the logic PECTL* for pPDA is in 2-EXPSPACE, and model-checking the qualitative fragment of PCTL for pPDA is in 2-EXPSPACE. Furthermore, model-checking the qualitative fragment of PCTL is shown to be EXPTIME-hard even for stateless pPDA. Finally, we show that PCTL model-checking is undecidable for pPDA, and PCTL+ model-checking is undecidable even for stateless pPDA.