Formal semantics of extended hierarchical state transition matrix by CSP

Authors:
Yoriyuki Yamagata;Weiqiang Kong;Akira Fukuda;Van Tang Nguyen;Hitoshi Ohsaki;Kenji Taguchi
Affiliations:
National Institute of Advanced Science and Technology, Amagasaki;Kyushu University, Fukuoka;Kyushu University, Fukuoka;National Institute of Advanced Science and Technology, Amagasaki;National Institute of Advanced Science and Technology, Amagasaki;National Institute of Advanced Science and Technology, Amagasaki
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
2012

Citing 4
Cited 0

The STATEMATE semantics of statecharts

ACM Transactions on Software Engineering and Methodology (TOSEM)
A Compositional Semantics for Statecharts using Labeled Transition Systems

CONCUR '94 Proceedings of the Concurrency Theory
An Automatic Approach to Model Checking UML State Machines

SSIRI-C '10 Proceedings of the 2010 Fourth International Conference on Secure Software Integration and Reliability Improvement Companion
An SMT-Based Approach to Bounded Model Checking of Designs in Communicating State Transition Matrix

ICCSA '11 Proceedings of the 2011 International Conference on Computational Science and Its Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Extended Hierarchical State Transition Matrix (EHSTM) is a table-based modeling language frequently used in industry for specifying behaviors of a system. However, assuring correctness, i.e., having a design satisfy certain desired properties, is a non-trivial task. To address this problem, a model checker dedicated to EHSTMs called Garakabu2 is developed. However, there is no formal justification of Garakabu2, since its semantics has never been fully formalized. In this paper, we give a formal semantics to EHSTM by translating it into CSP, Communicating Sequential Processes. Our semantics covers most of the features supported by Garakabu2. We manually translate the small examples of EHSTM to CSP, and verify them by PAT, a CSP based model checker. We also verify the examples directly using Garakabu2 and show the result are same. The experiments also show that verification using our translation and PAT is much faster than that of Garakabu2 for checking message type EHSTM.