Tools and Algorithms for the Construction and Analysis of Systems

DOI10.1007/B107194MaRDI QIDQ5703763zbMATH OpenOpenAlexFDO

Authors Kousha Etessami, Mihalis Yannakakis

Publication date 10 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b107194

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model checking of recursive probabilistic systems
• Automata, Languages and Programming
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• STACS 2005
• Automata, Probability, and Recursion

Cited in

(20)

• A note on the attractor-property of infinite-state Markov chains
• Formally verified algorithms for upper-bounding state space diameters
• Analyzing probabilistic pushdown automata
• Deciding probabilistic bisimilarity over infinite-state probabilistic systems
• Model checking of recursive probabilistic systems
• On probabilistic parallel programs with process creation and synchronisation
• Runtime analysis of probabilistic programs with unbounded recursion
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Automata, Probability, and Recursion
• Branching-time model-checking of probabilistic pushdown automata
• Branching-time model-checking of probabilistic pushdown automata
• Computer Aided Verification
• On the Complexity of Ltl Model-Checking of Recursive State Machines
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Efficient analysis of probabilistic programs with an unbounded counter
• STACS 2005
• Reachability in Recursive Markov Decision Processes
• Probabilistic verification beyond context-freeness
• Runtime analysis of probabilistic programs with unbounded recursion
• Verification of well-formed communicating recursive state machines

This page was built for publication: Tools and Algorithms for the Construction and Analysis of Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703763)