The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Neste artigo, propomos um algoritmo para converter uma determinada especificação LOTOS estruturada em um modelo nivelado equivalente denominado EFSMs síncronos. O modelo EFSMs síncronos é um modelo de execução para protocolos de comunicação e sistemas distribuídos onde cada sistema consiste em EFSMs simultâneos e um conjunto finito de indicações de múltiplos encontros entre seus subconjuntos. Os EFSMs podem ser derivados de uma especificação em uma subclasse de LOTOS e sua implementação se torna mais simples do que a implementação direta da especificação LOTOS original porque a sincronização entre os processos no modelo não possui nenhum relacionamento filho-pai, o que pode tornar o mecanismo de sincronização é muito mais complexo. Alguns resultados experimentais são relatados para mostrar a vantagem dos EFSMs síncronos em termos de eficiência de execução.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
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
Copiar
@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},}
Copiar
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 -