| Authors: | Hoang, Chi Thanh |
| Keywords: | Reliance alphabet;trace;Petri net;concurrent step |
| Issue Date: | 2006 |
| Publisher: | H. : ĐHQGHN |
| Series/Report no.: | Vol. 22;No. 2 (2006) |
| Abstract: | Finding concurrent processes of a system is an objective of system controls, because it shows an optimal way to perform processes. In this paper we build two iterative algorithms for transforming sequential processes of a reliance alphabet and of a Place/Transition net into concurrent ones. The complexity of these algorithms is also considered. |
| Description: | p. 55-64 |
| URI: | http://repository.vnu.edu.vn/handle/VNU_123/57770 |
| ISSN: | 2588-1124 |
| Appears in Collections: | Mathematics and Physics |
Thứ Ba, 22 tháng 8, 2017
“Shift-Left” Algorithms transforming sequential processes into concurrent ones
Đăng ký:
Đăng Nhận xét (Atom)
Không có nhận xét nào:
Đăng nhận xét