| Publication | Date of Publication | Type |
|---|
Verifying hybrid automata networks guided by task scenarios
Formal Methods in System Design | 2026-03-23 | Paper |
| Iteratively synthesizing \(\epsilon\)-robust barrier certificates for neural network controlled systems | 2026-03-20 | Paper |
Approximate optimal hybrid control synthesis by classification-based derivative-free optimization
Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control | 2024-02-21 | Paper |
HAT: analyzing linear hybrid automata as labelled transition system
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Loop reduction techniques for reachability analysis of linear hybrid automata
Science China Information Sciences | 2022-10-28 | Paper |
Machine learning steered symbolic execution framework for complex software code
Formal Aspects of Computing | 2021-08-30 | Paper |
| A novel approach for solving the BMI problem in barrier certificates generation | 2021-02-04 | Paper |
Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure
IEEE Transactions on Computers | 2017-06-08 | Paper |
SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata
Formal Methods in System Design | 2014-12-05 | Paper |
Towards an efficient path-oriented tool for bounded reachability analysis of linear hybrid systems using linear programming
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
Partial order path technique for checking parallel timed automata
Lecture Notes in Computer Science | 2011-04-08 | Paper |
Robustness testing for software components
Science of Computer Programming | 2010-08-26 | Paper |
Path-oriented reachability verification of a class of nonlinear hybrid automata using convex programming
Lecture Notes in Computer Science | 2010-01-14 | Paper |
A quadratic-time DBM-based successor algorithm for checking timed automata
Information Processing Letters | 2009-12-18 | Paper |
Remove irrelevant atomic formulas for timed automaton model checking
Journal of Computer Science and Technology | 2006-10-12 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-01-10 | Paper |
| scientific article; zbMATH DE number 2165695 (Why is no real title available?) | 2005-05-06 | Paper |
Duration-constrained regular expressions
Formal Aspects of Computing | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2006479 (Why is no real title available?) | 2003-11-20 | Paper |
Positive loop-closed automata: A decidable class of hybrid systems
The Journal of Logic and Algebraic Programming | 2003-02-13 | Paper |
| scientific article; zbMATH DE number 1852175 (Why is no real title available?) | 2003-01-09 | Paper |
Efficient verification of a class of time Petri nets using linear programming
Information Processing Letters | 2002-07-14 | Paper |
Checking MSC specifications for timing inconsistency
Journal of Computer Science and Technology | 2002-06-05 | Paper |
Linear hybrid action systems
Nordic Journal of Computing | 2001-09-27 | Paper |
Verifying time Petri nets by linear programming
Journal of Computer Science and Technology | 2001-06-19 | Paper |
| scientific article; zbMATH DE number 1533444 (Why is no real title available?) | 2001-03-06 | Paper |
