Theoretical Aspects of Computing - ICTAC 2004
From MaRDI portal
Publication:5709980
DOI10.1007/b107116zbMath1108.68497OpenAlexW2493490011MaRDI QIDQ5709980
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b107116
Related Items (34)
Synthesizing optimal bias in randomized self-stabilization ⋮ Parameter Synthesis Algorithms for Parametric Interval Markov Chains ⋮ Scenario-Based Verification of Uncertain MDPs ⋮ Formal abstraction and synthesis of parametric stochastic processes ⋮ Model checking finite-horizon Markov chains with probabilistic inference ⋮ Model-Based Formal Reliability Analysis of Grid Dynamics with Solar Energy Sources ⋮ Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC ⋮ Fine-tuning the odds in Bayesian networks ⋮ Gradient-descent for randomized controllers under partial observability ⋮ Out of control: reducing probabilistic models by control-state elimination ⋮ The complexity of reachability in parametric Markov decision processes ⋮ Parametric probabilistic transition systems for system design and analysis ⋮ Unnamed Item ⋮ Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems ⋮ Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination ⋮ Parameter-Independent Strategies for pMDPs via POMDPs ⋮ Incremental Verification of Parametric and Reconfigurable Markov Chains ⋮ Parameter synthesis in Markov models: a gentle survey ⋮ End-to-end statistical model checking for parametric ODE models ⋮ POMDP controllers with optimal budget ⋮ Markov chains and Markov decision processes in Isabelle/HOL ⋮ Unnamed Item ⋮ Parameter and Controller Synthesis for Markov Chains with Actions and State Labels. ⋮ Sampling-Based Verification of CTMCs with Uncertain Rates ⋮ Exact quantitative probabilistic model checking through rational search ⋮ Are Parametric Markov Chains Monotonic? ⋮ Model Repair for Probabilistic Systems ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ An extension of the inverse method to probabilistic timed automata ⋮ Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey ⋮ Finding provably optimal Markov chains ⋮ Inductive synthesis for probabilistic programs reaches new horizons ⋮ Quantitative static analysis of communication protocols using abstract Markov chains ⋮ Smoothed model checking for uncertain continuous-time Markov chains
Uses Software
This page was built for publication: Theoretical Aspects of Computing - ICTAC 2004
