TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION SYSTEM

MUTMAINAH, Siti and PULUNGAN, Reza (2012) TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION SYSTEM. Kaunia Jurnal Sains dan Teknologi, V.VIII (No. 1). pp. 44-47. ISSN 2301-8550

[img]
Preview
Text (TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION SYSTEM)
05-Kaunia-Vol.VIII-No.1-Siti-Mutmainnah-Reza-TRANSFORMASI-CHANNEL-SYSTEM-KE-LABELLED-HAL-44-47.pdf - Published Version

Download (393kB) | Preview

Abstract

A parallel system must be developed with extra precision to achieve a high level of dependability to produce error-free software. Therefore, we need an appropriate and formal model of the system. The model is necessary for verification software in model checking. A model that is often used in model checking is Labelled Transition System (LTS). An LTS can be generated from Program Graphs (PG), which are representations of programs in any programming language. However, in modeling a parallel system we need to describe the communications(model of interactivity) between the Program Graphs. For this purpose, we need and use Channel Systems (CS). Therefore, we often need to transform CS to LTS. The aim of this research is to developa transformation algorithm to generate an LTS from a given CS. Through the concept of parallelism, the algorithm is constructed by exploiting the so-called Structured Operational Semantic (SOS) of the CS. The transformation algorithm is implemented by developing a prototype tool designed with 3 essential components:input, process and output. Input is a text file that contains a model of a parallel system in the form of a CS. The model will be processed by using thetransformation algorithm that generates an LTS as output text file. Functionally, the algorithm can handle models of parallel systems written ina CS that consists of several PGs containing both looping and branching. Moreover, it has ability to satisfy various parallelism models such as interleaving, synchronous and asynchronous. Keywords: Channel System (CS), Labelled Transition System (LTS), parallel, Program Graph (PG), statesemantic

Item Type: Article
Uncontrolled Keywords: Channel System (CS), Labelled Transition System (LTS), parallel, Program Graph (PG), statesemantic
Subjects: Kaunia Jurnal
Divisions: Artikel (Terbitan Luar UIN)
Depositing User / Editor: Sugeng Hariyanto, SIP (sugeng.hariyanto@uin-suka.ac.id)
Date Deposited: 18 Dec 2015 02:51
Last Modified: 18 Dec 2015 02:52
URI: http://digilib.uin-suka.ac.id/id/eprint/18714

Actions (login required)

View Item View Item