Tools and Algorithms for the Construction and Analysis of Systems
From MaRDI portal
Publication:5703763
DOI10.1007/b107194zbMath1087.68054OpenAlexW2497867240MaRDI QIDQ5703763
Mihalis Yannakakis, Kousha Etessami
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
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Branching-time model-checking of probabilistic pushdown automata ⋮ Model Checking Temporal Properties of Recursive Probabilistic Programs ⋮ On Probabilistic Parallel Programs with Process Creation and Synchronisation ⋮ Runtime Analysis of Probabilistic Programs with Unbounded Recursion ⋮ Analyzing probabilistic pushdown automata ⋮ Deciding probabilistic bisimilarity over infinite-state probabilistic systems ⋮ Branching-Time Model-Checking of Probabilistic Pushdown Automata ⋮ Runtime analysis of probabilistic programs with unbounded recursion ⋮ A note on the attractor-property of infinite-state Markov chains ⋮ Efficient Analysis of Probabilistic Programs with an Unbounded Counter
This page was built for publication: Tools and Algorithms for the Construction and Analysis of Systems
