A Small Model Theorem for Rectangular Hybrid Automata Networks

Abstract : Rectangular hybrid automata (RHA) are finite state machines with additional skewed clocks that are useful for modeling realtime systems. This paper is concerned with the uniform verification of safety properties of networks with arbitrarily many interacting RHAs. Each automaton is equipped with a finite collection of pointers to other automata that enables it to read their state. This paper presents a small model result for such networks that reduces the verification problem for a system with arbitrarily many processes to a system with finitely many processes. The result is applied to verify and discover counterexamples of inductive invariant properties for distributed protocols like Fischer’s mutual exclusion algorithm and the Small Aircraft Transportation System (SATS).We have implemented a prototype tool called Passel relying on the satisfiability modulo theories (SMT) solver Z3 to check inductive invariants automatically.
Type de document :
Communication dans un congrès
Holger Giese; Grigore Rosu. 14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2012, Stockholm, Sweden. Springer, Lecture Notes in Computer Science, LNCS-7273, pp.18-34, 2012, Formal Techniques for Distributed Systems. 〈10.1007/978-3-642-30793-5_2〉
Liste complète des métadonnées

Littérature citée [40 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01528730
Contributeur : Hal Ifip <>
Soumis le : lundi 29 mai 2017 - 15:53:55
Dernière modification le : lundi 29 mai 2017 - 15:55:37
Document(s) archivé(s) le : mercredi 6 septembre 2017 - 11:32:43

Fichier

978-3-642-30793-5_2_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Taylor Johnson, Sayan Mitra. A Small Model Theorem for Rectangular Hybrid Automata Networks. Holger Giese; Grigore Rosu. 14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2012, Stockholm, Sweden. Springer, Lecture Notes in Computer Science, LNCS-7273, pp.18-34, 2012, Formal Techniques for Distributed Systems. 〈10.1007/978-3-642-30793-5_2〉. 〈hal-01528730〉

Partager

Métriques

Consultations de la notice

23

Téléchargements de fichiers

20