The following pages link to Naijun Zhan (Q208297):
Displayed 32 items.
- A “Hybrid” Approach for Synthesizing Optimal Controllers of Hybrid Systems: A Case Study of the Oil Pump Industrial Example (Q4647861) (← links)
- Reachability Analysis for Solvable Dynamical Systems (Q4682245) (← links)
- Robust Invariant Sets Computation for Discrete-Time Perturbed Nonlinear Systems (Q5034104) (← links)
- Learning One-Clock Timed Automata (Q5039523) (← links)
- Compositional Hoare-Style Reasoning About Hybrid CSP in the Duration Calculus (Q5045379) (← links)
- Synthesizing SystemC Code from Delay Hybrid CSP (Q5055993) (← links)
- Switching controller synthesis for time-delayed hybrid systems (Q5064257) (← links)
- Finding Polynomial Loop Invariants for Probabilistic Programs (Q5096098) (← links)
- Inner-Approximating Reachable Sets for Polynomial Systems With Time-Varying Uncertainties (Q5125565) (← links)
- CCMC: A Conditional CSL Model Checker for Continuous-Time Markov Chains (Q5166709) (← links)
- (Q5196885) (← links)
- Robust invariant sets generation for state-constrained perturbed polynomial systems (Q5239228) (← links)
- Extending Hybrid CSP with Probability and Stochasticity (Q5351874) (← links)
- Theoretical Aspects of Computing – ICTAC 2005 (Q5395097) (← links)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479166) (← links)
- Over- and Underapproximating Reach Sets for Perturbed Delay Differential Equations (Q5854002) (← links)
- Synthesizing Robust Domains of Attraction for State-Constrained Perturbed Polynomial Systems (Q5858104) (← links)
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation (Q5896943) (← links)
- An intuitive formal proof for deadline driven scheduler (Q5945840) (← links)
- Monitoring CTMCs by multi-clock timed automata (Q6041132) (← links)
- Robust non-termination analysis of numerical software (Q6041161) (← links)
- What's to come is still unsure. Synthesizing controllers resilient to delayed interaction (Q6109581) (← links)
- Formal verification of quantum algorithms using quantum Hoare logic (Q6154880) (← links)
- Learning deterministic one-clock timed automata via mutation testing (Q6160914) (← links)
- Decidability of the initial-state opacity of real-time automata (Q6165768) (← links)
- Taming delays in dynamical systems. Unbounded verification of delay differential equations (Q6194599) (← links)
- Switching controller synthesis for delay hybrid systems under perturbations (Q6201580) (← links)
- Robust Regions of Attraction Generation for State-Constrained Perturbed Discrete-Time Polynomial Systems (Q6308875) (← links)
- Inner-Approximating Reachable Sets for Polynomial Systems with Time-Varying Uncertainties (Q6309151) (← links)
- Reach-Avoid Differential Games Based on Invariant Generation (Q6309378) (← links)
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q6411355) (← links)
- Lower Bounds for Possibly Divergent Probabilistic Programs (Q6426252) (← links)