Naijun Zhan

From MaRDI portal
Person:208297

Available identifiers

zbMath Open zhan.naijunMaRDI QIDQ208297

List of research outcomes





PublicationDate of PublicationType
Introduction to the special Section on FM 20212024-09-25Paper
Reach-avoid verification based on convex optimization2024-07-21Paper
Reach-avoid analysis for polynomial stochastic differential equations2024-07-21Paper
Switching controller synthesis for delay hybrid systems under perturbations2024-02-21Paper
Formal verification of quantum algorithms using quantum Hoare logic2024-02-16Paper
Taming delays in dynamical systems. Unbounded verification of delay differential equations2024-02-16Paper
Decidability of the initial-state opacity of real-time automata2023-08-02Paper
What's to come is still unsure. Synthesizing controllers resilient to delayed interaction2023-07-28Paper
Learning deterministic one-clock timed automata via mutation testing2023-06-02Paper
Monitoring CTMCs by multi-clock timed automata2023-05-26Paper
Robust non-termination analysis of numerical software2023-05-26Paper
Lower Bounds for Possibly Divergent Probabilistic Programs2023-02-12Paper
Synthesizing SystemC Code from Delay Hybrid CSP2022-12-09Paper
Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming2022-12-08Paper
A denotational semantics of simulink with higher-order UTP2022-11-16Paper
Compositional Hoare-style reasoning about hybrid CSP in the duration calculus2022-11-04Paper
Learning one-clock timed automata2022-10-13Paper
Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming2022-09-20Paper
Probably approximately correct interpolants generation2022-09-01Paper
Finding polynomial loop invariants for probabilistic programs2022-08-12Paper
Synthesizing invariant barrier certificates via difference-of-convex programming2022-03-25Paper
Switching controller synthesis for time-delayed hybrid systems2022-03-21Paper
Robust Invariant Sets Computation for Discrete-Time Perturbed Nonlinear Systems2022-02-24Paper
Unified graphical co-modeling, analysis and verification of cyber-physical systems by combining AADL and simulink/stateflow2022-02-01Paper
Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control2021-09-30Paper
Inferring switched nonlinear dynamical systems2021-08-30Paper
Synthesizing robust domains of attraction for state-constrained perturbed polynomial systems2021-04-09Paper
Over- and Underapproximating Reach Sets for Perturbed Delay Differential Equations2021-03-12Paper
Unbounded-time safety verification of stochastic differential dynamics2021-02-09Paper
Nonlinear Craig interpolant generation2021-02-04Paper
Inner-Approximating Reachable Sets for Polynomial Systems With Time-Varying Uncertainties2020-10-07Paper
NIL: learning nonlinear interpolants2020-03-10Paper
Unified graphical co-modelling of cyber-physical systems using AADL and Simulink/Stateflow2020-02-18Paper
Validated simulation-based verification of delayed differential dynamics2020-01-03Paper
Approximate bisimulation and discretization of hybrid CSP2020-01-03Paper
Robust invariant sets generation for state-constrained perturbed polynomial systems2019-10-22Paper
Overview of formal methods2019-09-20Paper
Under-approximating reach sets for polynomial continuous systems2018-12-06Paper
Model checking bounded continuous-time extended linear duration invariants2018-12-06Paper
Reach-Avoid Differential Games Based on Invariant Generation2018-11-07Paper
Inner-Approximating Reachable Sets for Polynomial Systems with Time-Varying Uncertainties2018-11-02Paper
Robust Regions of Attraction Generation for State-Constrained Perturbed Discrete-Time Polynomial Systems2018-10-28Paper
Reachability Analysis for Solvable Dynamical Systems2018-09-18Paper
Automatic verification of stability and safety for delay differential equations2018-03-01Paper
Safety verification of trajectory planning for multiple robots2018-01-29Paper
Formal Verification of Simulink/Stateflow Diagrams2018-01-08Paper
Safe over- and under-approximation of reachable sets for delay differential equations2017-12-01Paper
A compositional modelling and verification framework for stochastic hybrid systems2017-09-08Paper
Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems2017-09-06Paper
Extending hybrid CSP with probability and stochasticity2017-08-31Paper
Bounded model-checking of discrete duration calculus2017-05-16Paper
A two-way path between formal and informal design of embedded systems2017-04-04Paper
Barrier certificates revisited2017-02-06Paper
Interpolant synthesis for quadratic polynomial inequalities and combination with EUF2016-09-05Paper
Decidability of the reachability for a family of linear vector fields2016-01-08Paper
Formal verification of Simulink/Stateflow diagrams2016-01-08Paper
Formal modelling, analysis and verification of hybrid systems2015-09-30Paper
Discovering non-terminating inputs for multi-path polynomial programs2015-04-27Paper
CCMC: a conditional CSL model checker for continuous-time Markov chains2014-07-08Paper
Generating non-linear interpolants by semidefinite programming2013-11-26Paper
An interface model of software components2013-10-04Paper
Compositional properties of sequential processes2013-09-20Paper
Synthesizing switching controllers for hybrid systems by generating invariants2013-08-16Paper
Recent advances in program verification through computer algebra2013-07-04Paper
Automatically discovering relaxed Lyapunov functions for polynomial dynamical systems2013-04-25Paper
Model checking conditional CSL for continuous-time Markov chains2013-03-21Paper
A ``hybrid approach for synthesizing optimal controllers of hybrid systems: a case study of the oil pump industrial example2012-11-08Paper
An assume/guarantee based compositional calculus for hybrid CSP2012-07-16Paper
Symbolic decision procedure for termination of linear programs2011-05-27Paper
Connection between logical and algebraic approaches to concurrent systems2010-12-01Paper
On hierarchically developing reactive systems2010-10-07Paper
Rate monotonic scheduling re-analysed2010-09-07Paper
Component publications and compositions2010-08-31Paper
Model checking linear duration invariants of networks of automata2010-01-28Paper
Formalising scheduling theories in duration calculus2009-10-12Paper
Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation2009-08-11Paper
Refinement and verification in component-based model-driven design2009-03-02Paper
Generating Polynomial Invariants with DISCOVERER and QEPCAD2008-09-25Paper
Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems2008-09-17Paper
A Model of Component-Based Programming2008-07-01Paper
A higher-order duration calculus and its completeness2007-02-20Paper
Theoretical Aspects of Computing – ICTAC 20052006-11-01Paper
Formal Techniques for Networked and Distributed Systems - FORTE 20052006-07-07Paper
https://portal.mardi4nfdi.de/entity/Q44143932003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q27536912001-11-11Paper
An intuitive formal proof for deadline driven scheduler2001-10-14Paper

Research outcomes over time

This page was built for person: Naijun Zhan