Fast Computation Methods for the Kleene Star in Max-Plus Linear Systems with a DAG Structure

スポンサーリンク

概要

• 論文の詳細を見る

• This research proposes efficient calculation methods for the transition matrices in discrete event systems, where the adjacency matrices are represented by directed acyclic graphs. The essence of the research focuses on obtaining the Kleene Star of an adjacency matrix. Previous studies have proposed methods for calculating the longest paths focusing on destination nodes. However, in these methods the chosen algorithm depends on whether the adjacency matrix is sparse or dense. In contrast, this research calculates the longest paths focusing on source nodes. The proposed methods are more efficient than the previous ones, and are attractive in that the efficiency is not affected by the density of the adjacency matrix.

• （社）電子情報通信学会の論文
• 2009-11-01

著者

• GOTO Hiroyuki

  Nagaoka University of Technology

• Goto Hiroyuki

  Nagaoka Univ. Of Technol. Nagaoka‐shi Jpn

• Takahashi Hirotaka

  Nagaoka University Of Technology

• Goto Hiroyuki

  Nagaoka Univ. Of Technol.

関連論文

• High-Speed Computation of the Kleene Star in Max-Plus Algebraic System Using a Cell Broadband Engine
• Acceleration of Computing the Kleene Star in Max-Plus Algebra Using CUDA GPUs
• Consideration of Capacity and Order Constraints for Event-Varying MPL Systems(Systems and Control)
• Efficient Calculation of the Transition Matrix in a Max-Plus Linear State-Space Representation
• High-Speed Computation of the Kleene Star in Max-Plus Algebraic System Using a Cell Broadband Engine
• Fast Computation Methods for the Kleene Star in Max-Plus Linear Systems with a DAG Structure
• Efficient Representation of the State Equation in Max-Plus Linear Systems with Interval Constrained Parameters

スポンサーリンク