B Model Abstraction Combining Syntactic and Semantic Methods
In a model-based testing approach as well as for the verification of properties by model-checking, B models provide an interesting solution. But for industrial applications, the size of their state space often makes them hard to handle. To reduce the amount of states, an abstraction function can be used, often combining state variable elimination and domain abstractions of the remaining variables. This paper illustrates a computer aided abstraction process that combines syntactic and semantic abstraction functions. The first function syntactically transforms a B event system M into an abstract one A, and the second one transforms a B event system into a Symbolic Labelled Transition System (SLTS). The syntactic transformation suppresses some variables in M. This function is correct in the sense that A is refined by M. A process that combines the syntactic and semantic abstractions has been experimented. It significantly reduces the time cost of semantic abstraction computation. This abstraction process allows for verifying safety properties by model-checking or for generating abstract tests. These tests are generated by a coverage criteria such as all states or all transitions of an SLTS.
KeywordsModel Abstraction Syntactic Abstraction Refinement
- [JSBM09]Julliand, J., Stouls, N., Bué, P.-C., Masson, P.-A.: B model abstraction combining syntactic and semantics methods. Research Report RR2009-04, LIFC - Laboratoire d’Informatique de l’Université de Franche Comté, 15 pages (November 2009)Google Scholar