Pages that link to "Item:Q5709980"

The following pages link to Theoretical Aspects of Computing - ICTAC 2004 (Q5709980):

Displaying 46 items.

• Smoothed model checking for uncertain continuous-time Markov chains (Q259074) (← links)
• Formal abstraction and synthesis of parametric stochastic processes (Q832046) (← links)
• Model checking finite-horizon Markov chains with probabilistic inference (Q832295) (← links)
• Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
• Symbolic dependency graphs for \(\mathrm {PCTL}^{>}_{\leq}\) model-checking (Q1683447) (← links)
• Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
• Finding provably optimal Markov chains (Q2044197) (← links)
• Inductive synthesis for probabilistic programs reaches new horizons (Q2044199) (← links)
• Synthesizing optimal bias in randomized self-stabilization (Q2121058) (← links)
• Fine-tuning the odds in Bayesian networks (Q2146027) (← links)
• Gradient-descent for randomized controllers under partial observability (Q2152644) (← links)
• Out of control: reducing probabilistic models by control-state elimination (Q2152665) (← links)
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination (Q2182734) (← links)
• Exact quantitative probabilistic model checking through rational search (Q2225475) (← links)
• An extension of the inverse method to probabilistic timed automata (Q2248053) (← links)
• Quantitative static analysis of communication protocols using abstract Markov chains (Q2322314) (← links)
• Distributed disk-based algorithms for model checking very large Markov chains (Q2431769) (← links)
• Formal reasoning about finite-state discrete-time Markov chains in HOL (Q2434565) (← links)
• Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC (Q2633503) (← links)
• The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
• An inductive technique for parameterised model checking of degenerative distributed randomised protocols (Q2810974) (← links)
• Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems (Q2945585) (← links)
• Approximate Verification of the Symbolic Dynamics of Markov Chains (Q2986781) (← links)
• Model Repair for Probabilistic Systems (Q3000664) (← links)
• Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (Q3003315) (← links)
• Are Parametric Markov Chains Monotonic? (Q3297607) (← links)
• (Q3384160) (← links)
• Scenario-Based Verification of Uncertain MDPs (Q5039513) (← links)
• Model-Based Formal Reliability Analysis of Grid Dynamics with Solar Energy Sources (Q5054367) (← links)
• Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
• Consistency for parametric interval Markov chains (Q5240149) (← links)
• Parameter and Controller Synthesis for Markov Chains with Actions and State Labels. (Q5240153) (← links)
• Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479151) (← links)
• On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375) (← links)
• Parameter Synthesis Algorithms for Parametric Interval Markov Chains (Q5881537) (← links)
• Parameter-Independent Strategies for pMDPs via POMDPs (Q6104800) (← links)
• Incremental Verification of Parametric and Reconfigurable Markov Chains (Q6104805) (← links)
• End-to-end statistical model checking for parametric ODE models (Q6160770) (← links)
• POMDP controllers with optimal budget (Q6160772) (← links)
• Sampling-Based Verification of CTMCs with Uncertain Rates (Q6399373) (← links)
• Automatically finding the right probabilities in Bayesian networks (Q6488813) (← links)
• Efficient sensitivity analysis for parametric robust Markov chains (Q6535680) (← links)
• Parameter synthesis for Markov models: covering the parameter space (Q6564178) (← links)
• Interval Markov decision processes with multiple objectives: from robust strategies to Pareto curves (Q6600072) (← links)
• End-to-end statistical model checking for parameterization and stability analysis of ODE models (Q6639408) (← links)
• Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving (Q6639734) (← links)