Deriving Concurrent Synchronous EFSMs from Protocol Specifications in LOTOS

Akira KITAJIMA; Keiichi YASUMOTO; Teruo HIGASHINO; Kenichi TANIGUCHI

Deriving Concurrent Synchronous EFSMs from Protocol Specifications in LOTOS

Akira KITAJIMA, Keiichi YASUMOTO, Teruo HIGASHINO, Kenichi TANIGUCHI

Full Text Views

0

Cite this

Summary :

In this paper, we propose an algorithm to convert a given structured LOTOS specification into an equivalent flattened model called synchronous EFSMs. The synchronous EFSMs model is an execution model for communication protocols and distributed systems where each system consists of concurrent EFSMs and a finite set of multi-rendezvous indications among their subsets. The EFSMs can be derived from a specification in a sub-class of LOTOS and its implementation becomes simpler than the straightforward implementation of the original LOTOS specification because the synchronization among the processes in the model does not have any child-parent relationships, which can make the synchronization mechanism much more complex. Some experimental results are reported to show the advantage of synchronous EFSMs in terms of execution efficiency.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.3 pp.487-494

Publication Date: 1999/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa)

Category

Cite this

Copy

Akira KITAJIMA, Keiichi YASUMOTO, Teruo HIGASHINO, Kenichi TANIGUCHI, "Deriving Concurrent Synchronous EFSMs from Protocol Specifications in LOTOS" in IEICE TRANSACTIONS on Fundamentals, vol. E82-A, no. 3, pp. 487-494, March 1999, doi: .
Abstract: In this paper, we propose an algorithm to convert a given structured LOTOS specification into an equivalent flattened model called synchronous EFSMs. The synchronous EFSMs model is an execution model for communication protocols and distributed systems where each system consists of concurrent EFSMs and a finite set of multi-rendezvous indications among their subsets. The EFSMs can be derived from a specification in a sub-class of LOTOS and its implementation becomes simpler than the straightforward implementation of the original LOTOS specification because the synchronization among the processes in the model does not have any child-parent relationships, which can make the synchronization mechanism much more complex. Some experimental results are reported to show the advantage of synchronous EFSMs in terms of execution efficiency.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_3_487/_p

Copy

@ARTICLE{e82-a_3_487,
author={Akira KITAJIMA, Keiichi YASUMOTO, Teruo HIGASHINO, Kenichi TANIGUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Deriving Concurrent Synchronous EFSMs from Protocol Specifications in LOTOS},
year={1999},
volume={E82-A},
number={3},
pages={487-494},
abstract={In this paper, we propose an algorithm to convert a given structured LOTOS specification into an equivalent flattened model called synchronous EFSMs. The synchronous EFSMs model is an execution model for communication protocols and distributed systems where each system consists of concurrent EFSMs and a finite set of multi-rendezvous indications among their subsets. The EFSMs can be derived from a specification in a sub-class of LOTOS and its implementation becomes simpler than the straightforward implementation of the original LOTOS specification because the synchronization among the processes in the model does not have any child-parent relationships, which can make the synchronization mechanism much more complex. Some experimental results are reported to show the advantage of synchronous EFSMs in terms of execution efficiency.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Deriving Concurrent Synchronous EFSMs from Protocol Specifications in LOTOS
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 487
EP - 494
AU - Akira KITAJIMA
AU - Keiichi YASUMOTO
AU - Teruo HIGASHINO
AU - Kenichi TANIGUCHI
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1999
AB - In this paper, we propose an algorithm to convert a given structured LOTOS specification into an equivalent flattened model called synchronous EFSMs. The synchronous EFSMs model is an execution model for communication protocols and distributed systems where each system consists of concurrent EFSMs and a finite set of multi-rendezvous indications among their subsets. The EFSMs can be derived from a specification in a sub-class of LOTOS and its implementation becomes simpler than the straightforward implementation of the original LOTOS specification because the synchronization among the processes in the model does not have any child-parent relationships, which can make the synchronization mechanism much more complex. Some experimental results are reported to show the advantage of synchronous EFSMs in terms of execution efficiency.
ER -