Stuttering Congruence for χ

Abstract

Abstract. The language χ is a modeling and simulation language which is currently mainly used to analyse and optimize the performance of industrial systems. To be able to also verify functional properties of a system using a χ model, part of the language has been given a formal semantics. Rather than implementing a new model checker for χ, the philosophy is to provide automatic translations from χ into the specification languages of existing state-of-the-art model checkers such as, e.g., Spin and UPPAAL. In this paper, we propose for χ a notion of stuttering congruence, which is an adaptation of the notion of stuttering equivalence. We prove that our notion preserves the validity of CTL * −X formulas, that it preserves deadlock, and that it is indeed a congruence with respect to the constructs of χ. We also indicate how our notion is to be used to establish confidence in the correctness of a translation from χ into Promela.

Verifying χ Models of Industrial Systems with Spin

“…In [20] we support a part of our translation with a formal correctness proof. There we define a notion of equivalence for (a slightly different version of) χ, prove that it is a congruence and that it preserves validity of temporal logic formulas.…”