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.
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-01528730
Contributor : Hal Ifip <>
Submitted on : Monday, May 29, 2017 - 3:53:55 PM
Last modification on : Thursday, August 1, 2019 - 2:12:06 PM
Long-term archiving on : Wednesday, September 6, 2017 - 11:32:43 AM

File

978-3-642-30793-5_2_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Taylor Johnson, Sayan Mitra. A Small Model Theorem for Rectangular Hybrid Automata Networks. 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. pp.18-34, ⟨10.1007/978-3-642-30793-5_2⟩. ⟨hal-01528730⟩

Share

Metrics

Record views

88

Files downloads

93