Hierarchical Composition and Abstraction in Architecture Models

We present a compositional approach to generate linear hybrid automata timing models, and Markovian stochastic automata safety models, from an architecture specification. Formal models declared for components are composed to form an overall model for the system, where the composition rules depend on the semantics of the architecture specification. We further allow abstract models to be specified for a subsystem of components, where the abstract model may be substituted for the concrete model of that subsystem when composing the overall system model. We assume both abstract and concrete models are given, we address the problem of verifying that the abstractions yield safe if approximate results. An abstract model may be viewed as a formal subsystem specification used for both conformance checking and improving the tractability of system analysis.

[1]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[2]  Radha Jagadeesan,et al.  Metrics for labelled Markov processes , 2004, Theor. Comput. Sci..

[3]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[4]  Yannick Lefebvre.  Approximate aggregation and applications to reliability , 2002 .

[5]  John G. Kemeny,et al.  Properties of Markov Chains , 1976 .

[6]  Stavros Tripakis,et al.  Conformance testing for real-time systems , 2004, SPIN.

[7]  C. J. Stone,et al.  Introduction to Stochastic Processes , 1972 .

[8]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[9]  William H. Sanders,et al.  The Möbius state-level abstract functional interface , 2003, Perform. Evaluation.

[10]  William H. Sanders,et al.  Optimal state-space lumping in Markov chains , 2003, Inf. Process. Lett..

[11]  Holger Hermanns,et al.  Process Algebra and Markov Chains , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

[12]  Vijay Kumar,et al.  Hierarchical Hybrid Modeling of Embedded Systems , 2001, EMSOFT.

[13]  Steve Vestal.  Formal verification of the MetaH executive using linear hybrid automata , 2000, Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000.

[14]  Nancy A. Lynch,et al.  Hybrid I/O automata , 2003, Inf. Comput..

[15]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.