STACS 2005
From MaRDI portal
Publication:5710670
DOI10.1007/b106485zbMath1118.68520OpenAlexW4230940848MaRDI QIDQ5710670
Oldřich Stražovský, Tomáš Brázdil, Antonín Kučera
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (12)
The satisfiability problem for a quantitative fragment of PCTL ⋮ Satisfiability of quantitative probabilistic CTL: rise to the challenge ⋮ Model Checking Temporal Properties of Recursive Probabilistic Programs ⋮ Unnamed Item ⋮ Model checking probabilistic systems against pushdown specifications ⋮ Analyzing pushdown systems with stack manipulation ⋮ Reachability in recursive Markov decision processes ⋮ Analyzing probabilistic pushdown automata ⋮ Branching-Time Model-Checking of Probabilistic Pushdown Automata ⋮ The satisfiability problem for a quantitative fragment of PCTL ⋮ Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems ⋮ CSL model checking algorithms for QBDs
This page was built for publication: STACS 2005
