Anonymized Reachability of Hybrid Automata Networks

@inproceedings{Johnson2014AnonymizedRO,
  title={Anonymized Reachability of Hybrid Automata Networks},
  author={Taylor T. Johnson and Sayan Mitra},
  booktitle={FORMATS},
  year={2014}
}
In this paper, we present a method for computing the set of reachable states for networks consisting of the parallel composition of a finite number of the same hybrid automaton template with rectangular dynamics. The method utilizes a symmetric representation of the set of reachable states (modulo the automata indices) that we call anonymized states, which makes it scalable. Rather than explicitly enumerating each automaton index in formulas representing sets of states, the anonymized… 
Quantified Bounded Model Checking for Rectangular Hybrid Automata
TLDR
A new quantified encoding of BMC for rectangular hybrid automata (RHA) that requires using more general logics due to the real (dense) time and real-valued state variables modeling continuous states and may in the future be an effective analysis approach for RHA as further improvements are made in quantifier handling in SMT solvers such as Z3.
Verification using counterexample fragment based specification relaxation: case of modular/concurrent linear hybrid automata
TLDR
LhaVrf is presented, a symbolic verifier for the safety verification of concurrent LHA (Linear Hybrid Automaton), with capability of automatically translating the hybrid automata into discrete transition system, composing the concurrent model, and using satisfiability modulo theory solver for validating counterexamples and fast-searching for the unsat-core.
A Compositional Approach to the Verification of Hybrid Systems
TLDR
This paper presents an alternative which uses a compositional verification rule to automatically compute local properties and combine them such that together they are strong enough to prove global safety properties of systems.
SMT-Based Analysis of Virtually Synchronous Distributed Hybrid Systems
TLDR
A bisimulation equivalence is proved between Hybrid PALS synchronous and asynchronous models, and various verification problems for synchronous Hybrid P ALS models can be reduced to SMT solving over nonlinear theories of the real numbers.
Real-Time Reachability for Verified Simplex Design
TLDR
A combined online/offline approach, which uses aspects of the two earlier methods along with a real-time reach ability computation, also maintains safety, but with significantly less conservatism.

References

SHOWING 1-10 OF 37 REFERENCES
A Small Model Theorem for Rectangular Hybrid Automata Networks
TLDR
A small model result is presented for networks with arbitrarily many interacting RHAs that reduces the verification problem for a system with arbitrarily number of processes to a systems with finitely many processes.
Quasi-dependent variables in hybrid automata
TLDR
This work provides an effective generalisation of the recently introduced notion of quasi-equal clocks to hybrid systems by introducing the concept of semi-dependent variables, and demonstrates how such variables can be automatically detected and transformed.
Exploiting symmetry in temporal logic model checking
TLDR
What it means for a finite state system to be symmetric is formalized and techniques for reducing such systems when the transition relation is given explicitly in terms of states or symbolically as a BDD are described.
Reducing Quasi-Equal Clocks in Networks of Timed Automata
TLDR
This work introduces the novel notion of quasi-equal clocks and uses it to improve the verification time of networks of timed automata, which has a smaller set of clocks and preserves properties up to those not comparing quasi- equal clocks.
Static Guard Analysis in Timed Automata Verification
TLDR
A location-based finite zone abstraction is proposed, which computes an abstraction based on the relevant guards for a particular state of the model (as opposed to all guards), which generalises active-clock reduction and enlarges the class of timed automata that can be verified.
Better verification through symmetry
TLDR
This work provides a proof of the soundness of the new symmetry-based verification algorithm based on a definition of the formal semantics of a simple description language with scalarsets, and leads to an alternative characterization of data independence.
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
TLDR
This paper shall semi-formally introduce these time dependant models, discuss their strengths and weaknesses, and provide an overview of the known results about the relationships among the models.
Verifying Systems with Replicated Components in Murϕ
TLDR
This work provides an extension to the existing Murϕ language, by which a designer can easily specify a system in its concrete form, through a new datatype, called RepetitiveID, which automatically translates the system description to an abstract state graph for a system of a fixed size.
Detecting and Exploiting Symmetry in Discrete-State Markov Models
TLDR
This work proposes a new method for detecting and exploiting model symmetry in which models retain the structure of the system, and all symmetry inherent in theructure of the model can be detected and exploited for the purposes of state-space reduction.
Modeling and verifying hierarchical real-time systems using stateful timed CSP
TLDR
The PAT model checker is extended to support system modeling and verification using Stateful Timed CSP and show its usability/scalability via verification of real-world systems.
...
...