The following pages link to (Q5322945):
Displaying 50 items.
- Producing explanations for rich logics (Q2024339) (← links)
- IPL: an integration property language for multi-model cyber-physical systems (Q2024345) (← links)
- To compose, or not to compose, that is the question: an analysis of compositional state space generation (Q2024367) (← links)
- Compositional reasoning for shared-variable concurrent programs (Q2024370) (← links)
- Approximate partial order reduction (Q2024376) (← links)
- UNITY and Büchi automata (Q2026375) (← links)
- Book review of: J. F. Groote and M. R. Mousavi, Modeling and analysis of communicating systems (Q2026378) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- A spectral property for concurrent systems and some probabilistic applications (Q2032884) (← links)
- Static and dynamic property-preserving updates (Q2042718) (← links)
- Finding provably optimal Markov chains (Q2044197) (← links)
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees (Q2051763) (← links)
- Encoding safety in \(\mathrm{CLL}_R\) (Q2055960) (← links)
- Sampling polynomial trajectories for LTL verification (Q2055964) (← links)
- Decoy allocation games on graphs with temporal logic objectives (Q2056945) (← links)
- Funnel control for fully actuated systems under a fragment of signal temporal logic specifications (Q2061223) (← links)
- Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations (Q2061250) (← links)
- Logic for \(\omega\)-pushdown automata (Q2064532) (← links)
- Enhancing probabilistic model checking with ontologies (Q2065528) (← links)
- TOrPEDO : witnessing model correctness with topological proofs (Q2065548) (← links)
- Statistical model checking for variability-intensive systems: applications to bug detection and minimization (Q2065555) (← links)
- Moment-based analysis of Bayesian network properties (Q2072070) (← links)
- Symbolic models for infinite networks of control systems: a compositional approach (Q2074749) (← links)
- Safe-visor architecture for sandboxing (AI-based) unverified controllers in stochastic cyber-physical systems (Q2074755) (← links)
- Diagnosability verification using LTL model checking (Q2081084) (← links)
- Compositional construction of control barrier functions for continuous-time stochastic hybrid systems (Q2081792) (← links)
- Robust approximate symbolic models for a class of continuous-time uncertain nonlinear systems via a control interface (Q2081803) (← links)
- An algebraic method to fidelity-based model checking over quantum Markov chains (Q2084946) (← links)
- Computation tree logic model checking over possibilistic decision processes under finite-memory scheduler (Q2090217) (← links)
- Risk verification of stochastic systems with neural network controllers (Q2093383) (← links)
- Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models (Q2095426) (← links)
- Bounds for synchronizing Markov decision processes (Q2097220) (← links)
- Automated verification and synthesis of stochastic hybrid systems: a survey (Q2097770) (← links)
- Learning-based symbolic abstractions for nonlinear control systems (Q2097817) (← links)
- Lifted model checking for relational MDPs (Q2102421) (← links)
- Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations (Q2103672) (← links)
- A game-theoretic approach for the synthesis of complex systems (Q2104251) (← links)
- CTL* model checking for data-aware dynamic systems with arithmetic (Q2104496) (← links)
- Decisiveness of stochastic systems and its application to hybrid models (Q2105467) (← links)
- Comparison of algorithms for simple stochastic games (Q2105472) (← links)
- Model checking hyperproperties for Markov decision processes (Q2105474) (← links)
- Local higher-order fixpoint iteration (Q2105477) (← links)
- Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies (Q2106413) (← links)
- Robustly complete finite-state abstractions for verification of stochastic systems (Q2112105) (← links)
- Model checking for entanglement swapping (Q2112108) (← links)
- Timed games with bounded window parity objectives (Q2112117) (← links)
- Efficient convex zone merging in parametric timed automata (Q2112120) (← links)
- Context-free timed formalisms: robust automata and linear temporal logics (Q2113377) (← links)
- Formal synthesis of closed-form sampled-data controllers for nonlinear continuous-time systems under STL specifications (Q2116657) (← links)
- Verification of multiplayer stochastic games via abstract dependency graphs (Q2119119) (← links)
