TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION SYSTEM
Parallel system must be developed with extra precision to achieve a high level of dependability to produce error-free software. Therefore we need appropriate and formal model of system. The model is necessary for verification software in model checking. A model often used in model checking is LTS (L...
| Main Authors: | , |
|---|---|
| Format: | Thesis |
| Published: |
[Yogyakarta] : Universitas Gadjah Mada
2012
|
| Subjects: |
| _version_ | 1797032626851151872 |
|---|---|
| author | , SITI MUTMAINAH , Dr. Ing. Mhd Reza M.I Pulungan, S.Si., M.Sc., |
| author_facet | , SITI MUTMAINAH , Dr. Ing. Mhd Reza M.I Pulungan, S.Si., M.Sc., |
| author_sort | , SITI MUTMAINAH |
| collection | UGM |
| description | Parallel system must be developed with extra precision to achieve a high level
of dependability to produce error-free software. Therefore we need appropriate and
formal model of system. The model is necessary for verification software in model
checking. A model often used in model checking is LTS (Labelled Transition System).
LTS can be generated by Program Graph (PG) which is representation of programming
language. However, modeling parallel system needs to describe the communication
model of interactivity between a PG and another PG. So, the model can
use Channel System (CS).
To solve this case, it is necessary to transform CS to LTS. So, the aim of the research
is developing transformation algoritm to generate LTS from a CS. Through the
concept of parallelism, the algorithm is run by exploiting the so-called SOS (Structured
Operational Semantic) approach.
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 form of CS. The model will be processed by
using a transformation algoritm that generates LTS as output file.
Functionally, the algoritm can handle model of parallel system written by CS
that consists of various form of PG containing both looping and branching. Moreover,
it has ability to satisfy parallel process such as interleaving, synchronous and
asynchronous. In the performance testing, we can measure elapsed time and memory
used to produce states. The results of the research show that elapsed time and memory
tend to increase with the growth number of state, although it depends on the PG
model used in the CS. |
| first_indexed | 2024-03-13T22:40:59Z |
| format | Thesis |
| id | oai:generic.eprints.org:100055 |
| institution | Universiti Gadjah Mada |
| last_indexed | 2024-03-13T22:40:59Z |
| publishDate | 2012 |
| publisher | [Yogyakarta] : Universitas Gadjah Mada |
| record_format | dspace |
| spelling | oai:generic.eprints.org:1000552016-03-04T08:48:45Z https://repository.ugm.ac.id/100055/ TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION SYSTEM , SITI MUTMAINAH , Dr. Ing. Mhd Reza M.I Pulungan, S.Si., M.Sc., ETD Parallel system must be developed with extra precision to achieve a high level of dependability to produce error-free software. Therefore we need appropriate and formal model of system. The model is necessary for verification software in model checking. A model often used in model checking is LTS (Labelled Transition System). LTS can be generated by Program Graph (PG) which is representation of programming language. However, modeling parallel system needs to describe the communication model of interactivity between a PG and another PG. So, the model can use Channel System (CS). To solve this case, it is necessary to transform CS to LTS. So, the aim of the research is developing transformation algoritm to generate LTS from a CS. Through the concept of parallelism, the algorithm is run by exploiting the so-called SOS (Structured Operational Semantic) approach. 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 form of CS. The model will be processed by using a transformation algoritm that generates LTS as output file. Functionally, the algoritm can handle model of parallel system written by CS that consists of various form of PG containing both looping and branching. Moreover, it has ability to satisfy parallel process such as interleaving, synchronous and asynchronous. In the performance testing, we can measure elapsed time and memory used to produce states. The results of the research show that elapsed time and memory tend to increase with the growth number of state, although it depends on the PG model used in the CS. [Yogyakarta] : Universitas Gadjah Mada 2012 Thesis NonPeerReviewed , SITI MUTMAINAH and , Dr. Ing. Mhd Reza M.I Pulungan, S.Si., M.Sc., (2012) TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION SYSTEM. UNSPECIFIED thesis, UNSPECIFIED. http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=56315 |
| spellingShingle | ETD , SITI MUTMAINAH , Dr. Ing. Mhd Reza M.I Pulungan, S.Si., M.Sc., TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION SYSTEM |
| title | TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION
SYSTEM |
| title_full | TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION
SYSTEM |
| title_fullStr | TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION
SYSTEM |
| title_full_unstemmed | TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION
SYSTEM |
| title_short | TRANSFORMASI CHANNEL SYSTEM KE LABELLED TRANSITION
SYSTEM |
| title_sort | transformasi channel system ke labelled transition system |
| topic | ETD |
| work_keys_str_mv | AT sitimutmainah transformasichannelsystemkelabelledtransitionsystem AT dringmhdrezamipulunganssimsc transformasichannelsystemkelabelledtransitionsystem |