Muhammadun, . (2017) Design And Implementation Of Software For Finite Abstractions Of Max-Plus-Linear Systems Using Tree Without Recursive Functions. Masters thesis, ITS-Institut Teknologi Sepuluh Nopember.
Preview |
Text
1214201008-Master_Theses.pdf - Published Version Download (2MB) | Preview |
Abstract
Max-Plus-Linear (MPL) systems are a class of discrete-event systems with a continuous state space characterizing the timing of the underlying sequential discrete events. In the literature, there is an approach to analyze these systems based on finite abstractions. This algorithms have been implemented in MATLAB using list/matrix/vector data structure. Disadvantages of this implementation, operation makes the transition requires a long computation time. Then improvement against previous implementation in JAVA using tree data structure. This implementation successfully accelerate computation time but requires a larger memory allocation because its functions are recursive. This thesis
discuss implementation in C++ using tree data structure without recursive functions in the hope of improving the results obtained by the two previous implementations.
| Item Type: | Thesis (Masters) |
|---|---|
| Uncontrolled Keywords: | sistem Max-Plus-Linear, sistem transisi, model abstraksi, bisimulations, model checking |
| Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA76 Computer software |
| Divisions: | Faculty of Mathematics and Science > Mathematics > 44101-(S2) Master Thesis |
| Depositing User: | MUHAMMADUN MUHAMMADUN MUHAMMADUN |
| Date Deposited: | 10 Apr 2017 07:24 |
| Last Modified: | 06 Mar 2019 06:52 |
| URI: | http://repository.its.ac.id/id/eprint/3177 |
Actions (login required)
 |
View Item |