On Optimization in Composition of Concurrent Formal Specifications
Summary :
LOTOS parallel operator, which is a binary operator, is used to combine processes in order to express their concurrency. Unlike other LOTOS operators, various possibilities exist when combining processes by the parallel operator. If two processes are selected randomly for combining, the size of the composite intermediate process after combining may be large. In this paper, we propose an algorithm for selecting two processes out of three or more processes so that the size of the intermediate process is the smallest when combined by the parallel operator. Smaller size of an intermediate process means it takes less memory space which is very important in designing verification tools for systems or communication protocols specified in LOTOS.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.11 pp.2905-2908
- Publication Date
- 2004/11/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Concurrent Systems and Hybrid Systems)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Bhed Bahadur BISTA, "On Optimization in Composition of Concurrent Formal Specifications" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 11, pp. 2905-2908, November 2004, doi: .
Abstract: LOTOS parallel operator, which is a binary operator, is used to combine processes in order to express their concurrency. Unlike other LOTOS operators, various possibilities exist when combining processes by the parallel operator. If two processes are selected randomly for combining, the size of the composite intermediate process after combining may be large. In this paper, we propose an algorithm for selecting two processes out of three or more processes so that the size of the intermediate process is the smallest when combined by the parallel operator. Smaller size of an intermediate process means it takes less memory space which is very important in designing verification tools for systems or communication protocols specified in LOTOS.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_11_2905/_p
Copy
@ARTICLE{e87-a_11_2905,
author={Bhed Bahadur BISTA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Optimization in Composition of Concurrent Formal Specifications},
year={2004},
volume={E87-A},
number={11},
pages={2905-2908},
abstract={LOTOS parallel operator, which is a binary operator, is used to combine processes in order to express their concurrency. Unlike other LOTOS operators, various possibilities exist when combining processes by the parallel operator. If two processes are selected randomly for combining, the size of the composite intermediate process after combining may be large. In this paper, we propose an algorithm for selecting two processes out of three or more processes so that the size of the intermediate process is the smallest when combined by the parallel operator. Smaller size of an intermediate process means it takes less memory space which is very important in designing verification tools for systems or communication protocols specified in LOTOS.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - On Optimization in Composition of Concurrent Formal Specifications
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2905
EP - 2908
AU - Bhed Bahadur BISTA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2004
AB - LOTOS parallel operator, which is a binary operator, is used to combine processes in order to express their concurrency. Unlike other LOTOS operators, various possibilities exist when combining processes by the parallel operator. If two processes are selected randomly for combining, the size of the composite intermediate process after combining may be large. In this paper, we propose an algorithm for selecting two processes out of three or more processes so that the size of the intermediate process is the smallest when combined by the parallel operator. Smaller size of an intermediate process means it takes less memory space which is very important in designing verification tools for systems or communication protocols specified in LOTOS.
ER -
English
