A small model theorem for rectangular hybrid automata networks

Taylor T. Johnson, Sayan Mitra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationFormal Techniques for Distributed Systems - Joint 14th IFIP WG 6.1 International Conference, FMOODS 2012 and 32nd IFIP WG 6.1 International Conference, FORTE 2012, Proceedings
Pages18-34
Number of pages17
DOIs
StatePublished - 2012
Event14th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2012 and the 32nd IFIP International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2012 - Stockholm, Sweden
Duration: Jun 13 2012Jun 16 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7273 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2012 and the 32nd IFIP International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2012
CountrySweden
CityStockholm
Period6/13/126/16/12

Keywords

  • hybrid automata
  • parameterized verification
  • small model theorem
  • uniform verification

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A small model theorem for rectangular hybrid automata networks'. Together they form a unique fingerprint.

Cite this