Pages that link to "Item:Q3000664"

The following pages link to Model Repair for Probabilistic Systems (Q3000664):

Displaying 47 items.

• Smoothed model checking for uncertain continuous-time Markov chains (Q259074) (← links)
• Abstract model repair for probabilistic systems (Q1706149) (← links)
• Automation of fault-tolerant graceful degradation (Q1733388) (← links)
• Counterexample-guided inductive synthesis for probabilistic systems (Q1982641) (← links)
• Inductive synthesis for probabilistic programs reaches new horizons (Q2044199) (← links)
• Synthesizing optimal bias in randomized self-stabilization (Q2121058) (← links)
• Solving systems of bilinear equations for transition rate reconstruction (Q2145274) (← links)
• Fine-tuning the odds in Bayesian networks (Q2146027) (← links)
• Gradient-descent for randomized controllers under partial observability (Q2152644) (← links)
• Two AGM-style characterizations of model repair (Q2294584) (← links)
• System design of stochastic models using robustness of temporal properties (Q2348023) (← links)
• The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
• Deniable Functional Encryption (Q2798776) (← links)
• Least-violating control strategy synthesis with safety rules (Q2986905) (← links)
• Limited-information control of hybrid systems via reachable set propagation (Q2986906) (← links)
• Resilient synchronization in robust networked multi-agent systems (Q2986907) (← links)
• Learning nonlinear hybrid systems (Q2986908) (← links)
• Mining requirements from closed-loop control models (Q2986909) (← links)
• On the decidability of stability of hybrid systems (Q2986910) (← links)
• Lyapunov analysis of rigid body systems with impacts and friction via sums-of-squares (Q2986911) (← links)
• Hybrid control lyapunov functions for the stabilization of hybridsystems (Q2986912) (← links)
• A toolbox for simulation of hybrid systems in matlab/simulink (Q2986913) (← links)
• Stabhyli (Q2986914) (← links)
• Zélus (Q2986915) (← links)
• State estimation for polyhedral hybrid systems and applications to the Godunov scheme (Q2986916) (← links)
• Observer design for a class of piecewise affine hybrid systems (Q2986918) (← links)
• Automated analysis of real-time scheduling using graph games (Q2986919) (← links)
• Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets (Q2986920) (← links)
• One-shot computation of reachable sets for differential games (Q2986922) (← links)
• Tracking differentiable trajectories across polyhedra boundaries (Q2986923) (← links)
• Flowpipe approximation and clustering in space-time (Q2986925) (← links)
• Bounded model-checking of discrete duration calculus (Q2986927) (← links)
• Optimal CPU allocation to a set of control tasks with soft real--time execution constraints (Q2986929) (← links)
• Safe schedulability of bounded-rate multi-mode systems (Q2986930) (← links)
• Compositional heterogeneous abstraction (Q2986931) (← links)
• Quantitative timed simulation functions and refinement metrics for real-time systems (Q2986932) (← links)
• Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems (Q2986933) (← links)
• Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems (Q2986934) (← links)
• Control design for specifications on stochastic hybrid systems (Q2986935) (← links)
• Rewarding probabilistic hybrid automata (Q2986936) (← links)
• Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata (Q2986937) (← links)
• Specification-guided controller synthesis for linear systems and safe linear-time temporal logic (Q2986938) (← links)
• Temporal logic model predictive control for discrete-time systems (Q2986939) (← links)
• Iterative temporal motion planning for hybrid systems in partially unknown environments (Q2986941) (← links)
• Are Parametric Markov Chains Monotonic? (Q3297607) (← links)
• Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
• On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375) (← links)