Transformation of PROMELA to Channel Systems

• Main Authors: Huda, Sheila Nurul, Pulungan, Reza
• Format: Conference or Workshop Item PeerReviewed
• Language: English
• Published: 2013
• Subjects: Computation Theory and Mathematics
• Online Access: https://repository.ugm.ac.id/35109/1/HP-CSIT-13.pdf; https://repository.ugm.ac.id/35109/
• Institution: Universitas Gadjah Mada

This paper reports on an implementation of transformation of PROMELA models into Channel Systems, which will be further transformed into Labeled Transition Systems (LTSs). The objective of this transformation is to obtain a formal semantics for further model checking purposes. A Channel System is a way to describe communicating processes that run in parallel, where each process is represented by a Program Graph (PG). The main part of a Program Graph is a location transition which consists of the initial location, a guard which determines whether the transition is executable or not, an action that will be executed in the location transition, and the next location. This paper defined the location transition for PROMELA constructs such as assignments, communication actions, if-fi, do-od, and atomic steps.