IEICE TRANSACTIONS on transactions
Optimization of Concurrent Process Program Specification
Summary :
This paper proposes an algorithm for optimizing concurrent program specification generated by design automation techniques. Some of the information in automatically generated specifications can be modified for optimization. The proposed algorithm changes some signals between processes. The computational complexity of the algorithm is O(nlogn), where n is the number of states in a given process specification. Experimental application results demonstrate it useful not only to optimize individual process descriptions but also to change signals transferred between processes in the optimization.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E73-E No.12 pp.1994-2000
- Publication Date
- 1990/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on the 3rd Karuizawa Workshop on Circuits and Systems)
- Category
- Graphs and Petri Nets
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
June KATO, Masaki ITOH, Haruhisa ICHIKAWA, "Optimization of Concurrent Process Program Specification" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 12, pp. 1994-2000, December 1990, doi: .
Abstract: This paper proposes an algorithm for optimizing concurrent program specification generated by design automation techniques. Some of the information in automatically generated specifications can be modified for optimization. The proposed algorithm changes some signals between processes. The computational complexity of the algorithm is O(nlogn), where n is the number of states in a given process specification. Experimental application results demonstrate it useful not only to optimize individual process descriptions but also to change signals transferred between processes in the optimization.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_12_1994/_p
Copy
@ARTICLE{e73-e_12_1994,
author={June KATO, Masaki ITOH, Haruhisa ICHIKAWA, },
journal={IEICE TRANSACTIONS on transactions},
title={Optimization of Concurrent Process Program Specification},
year={1990},
volume={E73-E},
number={12},
pages={1994-2000},
abstract={This paper proposes an algorithm for optimizing concurrent program specification generated by design automation techniques. Some of the information in automatically generated specifications can be modified for optimization. The proposed algorithm changes some signals between processes. The computational complexity of the algorithm is O(nlogn), where n is the number of states in a given process specification. Experimental application results demonstrate it useful not only to optimize individual process descriptions but also to change signals transferred between processes in the optimization.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Optimization of Concurrent Process Program Specification
T2 - IEICE TRANSACTIONS on transactions
SP - 1994
EP - 2000
AU - June KATO
AU - Masaki ITOH
AU - Haruhisa ICHIKAWA
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 12
JA - IEICE TRANSACTIONS on transactions
Y1 - December 1990
AB - This paper proposes an algorithm for optimizing concurrent program specification generated by design automation techniques. Some of the information in automatically generated specifications can be modified for optimization. The proposed algorithm changes some signals between processes. The computational complexity of the algorithm is O(nlogn), where n is the number of states in a given process specification. Experimental application results demonstrate it useful not only to optimize individual process descriptions but also to change signals transferred between processes in the optimization.
ER -
English
