The following pages link to (Q4736610):
Displaying 21 items.
- Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system (Q264193) (← links)
- Model checking learning agent systems using Promela with embedded C code and abstraction (Q333329) (← links)
- Qualitative fault tolerance analysis for a class of hybrid systems (Q534384) (← links)
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques (Q547885) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- From control law diagrams to Ada via \textsf{Circus} (Q640296) (← links)
- Hybridization methods for the analysis of nonlinear systems (Q868432) (← links)
- Hybrid automata, reachability, and systems biology (Q969180) (← links)
- Computing reachable sets for uncertain nonlinear monotone systems (Q988783) (← links)
- Inclusion dynamics hybrid automata (Q999262) (← links)
- Pegasus: sound continuous invariant generation (Q2147687) (← links)
- Unwinding biological systems (Q2348024) (← links)
- Finite abstraction of mixed monotone systems with discrete and continuous inputs (Q2374568) (← links)
- Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution (Q2421451) (← links)
- Abstractions for hybrid systems (Q2475634) (← links)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- Proving Approximate Implementations for Probabilistic I/O Automata (Q2864525) (← links)
- Template-Based Unbounded Time Verification of Affine Hybrid Automata (Q2901366) (← links)
- Approximated Reachability on Hybrid Automata: Falsification meets Certification (Q4982085) (← links)
- (Q5079750) (← links)
- The minimum principle of hybrid optimal control theory (Q6188525) (← links)
