Bounded and unbounded safety verification using bisimulation metrics

Abstract : In this paper, we propose an algorithm for bounded safety verification for a class of hybrid systems described by metric transition systems. The algorithm combines exploration of the system trajectories and state space reduction using merging based on a bisimulation metric. The main novelty compared to an algorithm presented recently by Lerda et.al. lies in the introduction of a tuning parameter that makes it possible to increase the performances drastically. The second significant contribution of this work is a procedure that allows us to derive, in some cases, a proof of unbounded safety from a proof of bounded safety via a refinement step. We demonstrate the efficiency of the approach via experimental results.
Type de document :
Communication dans un congrès
Rupak Majumdar, Paulo Tabuada. HSCC 2009 - 12th International Conference Hybrid Systems: Computation and Control, Apr 2009, San Francisco, CA, United States. Springer, 5469, pp.426-440, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-00602-9_30〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00379746
Contributeur : Antoine Girard <>
Soumis le : mercredi 29 avril 2009 - 11:40:15
Dernière modification le : vendredi 24 novembre 2017 - 13:30:45

Identifiants

Collections

Citation

Gang Zheng, Antoine Girard. Bounded and unbounded safety verification using bisimulation metrics. Rupak Majumdar, Paulo Tabuada. HSCC 2009 - 12th International Conference Hybrid Systems: Computation and Control, Apr 2009, San Francisco, CA, United States. Springer, 5469, pp.426-440, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-00602-9_30〉. 〈hal-00379746〉

Partager

Métriques

Consultations de la notice

224