A small model theorem for rectangular hybrid automata networks

Authors:
Taylor T. Johnson;Sayan Mitra
Affiliations:
Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign;Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign
Venue:
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Year:
2012

Citing 33
Cited 0

Limits for automatic verification of finite-state concurrent systems

Information Processing Letters
The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?

Journal of Computer and System Sciences
Model checking

Model checking
Model checking of systems with many identical timed processes

Theoretical Computer Science
Automatic Deductive Verification with Invisible Invariants

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying Properties of Large Sets of Processes with Network Invariants

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
Automatic Verification of Parameterized Cache Coherence Protocols

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Parameterized Verification with Automatically Computed Inductive Assertions

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Multi-Clock Timed Networks

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Network invariants for real-time systems

Formal Aspects of Computing
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Safety verification of an aircraft landing protocol: a refinement approach

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Parameterized verification of infinite-state processes with global conditions

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Quantified differential dynamic logic for distributed hybrid systems

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Automatic verification of parametric specifications with complex topologies

IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Automating cut-off for multi-parameterized systems

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Quantified differential invariants

Proceedings of the 14th international conference on Hybrid systems: computation and control
A step towards verification and synthesis from simulink/stateflow models

Proceedings of the 14th international conference on Hybrid systems: computation and control
Satisfiability modulo theories: introduction and applications

Communications of the ACM
Adaptive cruise control: hybrid, distributed, and now formally verified

FM'11 Proceedings of the 17th international conference on Formal methods
SpaceEx: scalable verification of hybrid systems

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Software verification using k-induction

SAS'11 Proceedings of the 18th international conference on Static analysis
IIV: an invisible invariant verifier

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
PHAVer: algorithmic verification of hybrid systems past hytech

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Formal analysis of the operational concept for the small aircraft transportation system

Rigorous Development of Complex Fault-Tolerant Systems
Linear quantifier elimination as an abstract decision procedure

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Easy parameterized verification of biphase mark and 8n1 protocols

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Parametrized Verification of Distributed Cyber-Physical Systems: An Aircraft Landing Protocol Case Study

ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
Automated analysis of parametric timing-based mutual exclusion algorithms

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods

Quantified Score

Hi-index	0.00

Visualization

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.