Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets

スポンサーリンク

概要

• 論文の詳細を見る
• 2013-02-01

著者

• TAOKA Satoshi

  the Graduate School of Engineering, Hiroshima University

• WATANABE Toshimasa

  the Graduate School of Engineering, Hiroshima University

• YAMAUCHI Masahiro

  the School of Engineering, Kinki University

• OCHIIWA Satoru

  the Graduate School of Engineering, Hiroshima University

関連論文

• Experimental Evaluation of Two Algorithms for Computing Petri Net Invariants(Special Section on Concurrent Systems Technology)
• The Effect of 6-Degree Head-Down Bed Rest on Cardiac Vagal Reactivity Mediated by the Carotid Sinus Baroreflex
• Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase(Graph Algorithm, Foundations of Computer Science)
• Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants(Special Section on Concurrent System Technology and Its Application to Multiple Agent Systems)
• Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets

スポンサーリンク