Transformation of PROMELA to Channel Systems
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...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://repository.ugm.ac.id/35109/1/HP-CSIT-13.pdf |
| _version_ | 1826033537718943744 |
|---|---|
| author | Huda, Sheila Nurul Pulungan, Reza |
| author_facet | Huda, Sheila Nurul Pulungan, Reza |
| author_sort | Huda, Sheila Nurul |
| collection | UGM |
| description | 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. |
| first_indexed | 2024-03-05T23:23:32Z |
| format | Conference or Workshop Item |
| id | oai:generic.eprints.org:35109 |
| institution | Universiti Gadjah Mada |
| language | English |
| last_indexed | 2024-03-13T19:12:58Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | oai:generic.eprints.org:351092014-07-14T03:37:13Z https://repository.ugm.ac.id/35109/ Transformation of PROMELA to Channel Systems Huda, Sheila Nurul Pulungan, Reza Computation Theory and Mathematics 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. 2013-06-18 Conference or Workshop Item PeerReviewed application/pdf en https://repository.ugm.ac.id/35109/1/HP-CSIT-13.pdf Huda, Sheila Nurul and Pulungan, Reza (2013) Transformation of PROMELA to Channel Systems. In: The 2013 International Conference on Computer Science and Information Technology (CSIT-2013), June 16-18, 2013, Yogyakarta. |
| spellingShingle | Computation Theory and Mathematics Huda, Sheila Nurul Pulungan, Reza Transformation of PROMELA to Channel Systems |
| title | Transformation of PROMELA to Channel Systems |
| title_full | Transformation of PROMELA to Channel Systems |
| title_fullStr | Transformation of PROMELA to Channel Systems |
| title_full_unstemmed | Transformation of PROMELA to Channel Systems |
| title_short | Transformation of PROMELA to Channel Systems |
| title_sort | transformation of promela to channel systems |
| topic | Computation Theory and Mathematics |
| url | https://repository.ugm.ac.id/35109/1/HP-CSIT-13.pdf |
| work_keys_str_mv | AT hudasheilanurul transformationofpromelatochannelsystems AT pulunganreza transformationofpromelatochannelsystems |