Abstract
Hierarchical automata (HAs) represent a structured model of statecharts previously formalized in Isabelle/HOL. The present work extends this framework by an abstraction technique for HAs defined on infinite data spaces. This structure preserving abstraction enables the connection of the framework to the model checker SMV. This paper reports on the following results (a) We discuss abstractions of sequential automata, from which HAs are composed. Here we focus on the special problems of synchronous models and examine the feasibility of constructions for over- and underapproximations in order to preserve CTL properties. (b) Based on this results we describe a compositional abstraction technique, which can be applied to HAs. (c) We extend the formalization of HAs in Isabelle/HOL by suitable operators to construct abstractions inside the logic. (d) We present an efficient implementation of the abstraction process outside of the logic, which is integrated in the formalization by the oracle interface of Isabelle.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
