The following pages link to (Q5322945):
Displaying 50 items.
- On clock-aware LTL parameter synthesis of timed automata (Q1648651) (← links)
- A deductive approach towards reasoning about algebraic transition systems (Q1666122) (← links)
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria (Q1676496) (← links)
- Symbolic control design for monotone systems with directed specifications (Q1679067) (← links)
- On partial state matching (Q1682284) (← links)
- Model checking the evolution of gene regulatory networks (Q1683930) (← links)
- Probabilistic timed automata with clock-dependent probabilities (Q1685793) (← links)
- Simulation relations for fault-tolerance (Q1688554) (← links)
- Learning deterministic probabilistic automata from a model checking perspective (Q1689574) (← links)
- Compositional abstraction refinement for control synthesis (Q1690521) (← links)
- Augmented finite transition systems as abstractions for control synthesis (Q1693823) (← links)
- Towards scalable synthesis of stochastic control systems (Q1693824) (← links)
- Quantitative model checking of linear-time properties based on generalized possibility measures (Q1697514) (← links)
- Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
- From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories (Q1704601) (← links)
- Abstract model repair for probabilistic systems (Q1706149) (← links)
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus (Q1706163) (← links)
- Decentralized abstractions for multi-agent systems under coupled constraints (Q1712902) (← links)
- Symbolic checking of fuzzy CTL on fuzzy program graph (Q1713411) (← links)
- Probabilistic verification of hierarchical leader election protocol in dynamic systems (Q1713851) (← links)
- Verification of asynchronous systems with an unspecified component (Q1731830) (← links)
- Verification and control for probabilistic hybrid automata with finite bisimulations (Q1734511) (← links)
- Decompositions of graphs based on a new graph product (Q1735673) (← links)
- Robust control for signal temporal logic specifications using discrete average space robustness (Q1737745) (← links)
- Opacity for linear constraint Markov chains (Q1745942) (← links)
- Decomposition of quantum Markov chains and its applications (Q1747488) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Model checking Markov population models by stochastic approximations (Q1784959) (← links)
- Distributed synthesis for parameterized temporal logics (Q1784965) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- Data-driven modelling and probabilistic analysis of interactive software usage (Q1785866) (← links)
- Reachability in parametric interval Markov chains using constraints (Q1786613) (← links)
- Stabilization and control Lyapunov functions for language constrained discrete-time switched linear systems (Q1796985) (← links)
- Guaranteed model-based fault detection in cyber-physical systems: a model invalidation approach (Q1797058) (← links)
- A study on shuffle, stopwatches and independently evolving clocks (Q1938360) (← links)
- A formal approach to adaptive software: continuous assurance of non-functional requirements (Q1941849) (← links)
- Probabilistic verification of Herman's self-stabilisation algorithm (Q1941879) (← links)
- TASS: the toolkit for accurate scientific software (Q1949767) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- Counterexample-guided inductive synthesis for probabilistic systems (Q1982641) (← links)
- RiskStructures: a design algebra for risk-aware machines (Q1982648) (← links)
- Verify heaps via unified model checking (Q1986561) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- Intention as commitment toward time (Q1989411) (← links)
- Deep reinforcement learning with temporal logics (Q1996007) (← links)
- On subgame perfect equilibria in turn-based reachability timed games (Q1996016) (← links)
- Computer says no: verdict explainability for runtime monitors using a local proof system (Q1996872) (← links)
- Probabilistic black-box reachability checking (extended version) (Q2008284) (← links)
- Non-deterministic weighted automata evaluated over Markov chains (Q2009651) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
