Home
News
People
Publications
Courses
Vacancies
Contact
Pulp Fictions
Light
Dark
Automatic
Tarski's algebra
Reachability Analysis for Solvable Dynamical Systems
The reachability problem is one of the most important issues in the verification of hybrid systems. But unfortunately the reachable …
Ting Gan
,
Mingshuai Chen
,
Yangjia Li
,
Bican Xia
,
Naijun Zhan
PDF
Cite
Code
DOI
Computing Reachable Sets of Linear Vector Fields Revisited
The reachability problem is one of the most important issues in the verification of hybrid systems. But unfortunately the reachable …
Ting Gan
,
Mingshuai Chen
,
Yangjia Li
,
Bican Xia
,
Naijun Zhan
PDF
Cite
Code
Slides
DOI
Decidability of the Reachability for a Family of Linear Vector Fields
The reachability problem is one of the most important issues in the verification of hybrid systems. Computing the reachable sets of …
Ting Gan
,
Mingshuai Chen
,
Liyun Dai
,
Bican Xia
,
Naijun Zhan
PDF
Cite
Code
Slides
DOI
Cite
×