By Topic

Efficient calculation method of the transition matrix for Max-Plus Linear systems with buffer constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
H. Goto ; Department of Management and Information Systems Science, Nagaoka University of Technology, Japan ; M. Kasahara ; M. Tanaka

This research considers an efficient calculation method for the transition matrix in an MPL (Max-Plus Linear) state-space representation. This matrix can be generated by applying the Kleene star operator to an adjacency matrix. The proposed method, based on the idea of a topological sort in graph theory and block splitting, is able to calculate the transition matrix efficiently.

Published in:

Management of Innovation and Technology, 2008. ICMIT 2008. 4th IEEE International Conference on

Date of Conference:

21-24 Sept. 2008