YAMAUCHI Masahiro

    Department of Electronic Engineering and Computer Science Associate Professor
Last Updated :2021/01/20

Researcher Information

Degree

  • Ph.D(Engineering)(Hiroshima University)
  • (BLANK)(Hiroshima University)

J-Global ID

Research Interests

  • アルゴリズム   グラフ理論   スケジューリング   ペトリネット理論   Algorithm   Graph theory   Scheduling   Petri Net Theory   

Research Areas

  • Informatics / Information theory

Education

  •        - 1999  Hiroshima University  工学研究科  情報工学
  •        - 1999  Hiroshima University  Graduate School, Division of Engineering
  •        - 1992  Hiroshima University  Faculty of Engineering  Cluster 2 (Electrical, Electronic, System and Information)
  •        - 1992  Hiroshima University  Faculty of Engineering

Association Memberships

  • 電気学会   情報処理学会   電子情報通信学会   

MISC

  • Algorithms for Extracting Minimal Siphons Containing Specified Places in General Petri Net
    IEICE Trans. Fundamentals  E82-A-  (11)  2566  -2575  1999
  • Time Complexity Analysis of Minimal Siphon Extraction Problem of Petri Nets
    IEICE Trans. Fundamentals  E82-A-  (11)  2558  -2565  1999
  • A Heuristic Algorithm SDS for Scheduling with Timed Petri Nets
    Proc. 1999 IEEE International Symposium on Circuits and Systems (ISCAS)  VI-  VI-81-VI-84  1999
  • Extracting Siphons Containing a Specified Set of Places in a Petri Net(共著)
    Proc. 1998 IEEE International Conference on Systems, Man and Cybernetics(SMC)  142  -147  1998
  • A Heuristic Algorithm FSD for the Legal Firing Sequence Problem of Petri Nets(共著)
    Proc. 1998 IEEE International Conference on Systems, Man and Cybernetics(SMC)  78  -83  1998
  • A Heuristic Algorithm for the Minimum Initial Marking Problem of Petri nets(共著)
    1997 IEEE International Conference on Systems, Man and Cybernetics(SMC)  1013  -1016  1997
  • Finding a Minimal Siphon Containing Specified Places in a General Petri Net(共著)
    IEICE Trans. Fundamentals  E79-A-  (11)  1825  -1828  1996
  • Finding Minimal Siphons in General Petri Nets(共著)
    IEICE Trans. Fundamentals  E79-A-  (11)  1817  -1824  1996
  • Finding a Maximal Class of Mutually Disjoint Minimal Siphons in General Petri Nets(共著)
    Proc. 1996 International Technical Conference on Circuits/Systems, Computers and Communications(ITC-CSCC)  1196  -1199  1996
  • Real-Time Scheduling with Flexible Strategy in Constructing Priority-Lists(共著)
    Proc. 1996 International Technical Conference on Circuits/Systems, Computers and Communications(ITC-CSCC)  1188  -1191  1996
  • An Approximation Algorithm for the Legal Firing Sequence Problem of Petri Nets(共著)
    Proc. 1994 IEEE International Symposium on Circuits and Systems  181  -184  1994
  • New Priority-Lists for Scheduling in Timed Petri Nets(共著)
    Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany (Proc. Application and Theory of Petri Nets 1993)  691-  493  -512  1993
  • A New Approximation Algorithm for the Minimum Initial Marking Problem of Petri Nets(共著)
    Proc. 6th Karuizawa Workshop on Circuits and Systems, IEICE of Japan  279  -284  1993
  • The Minimum Initial Marking Problem for Scheduling in Timed Petri Nets(共著)
    Trans. IEICE of Japan  E75-A-  (10)  1407  -1421  1992
  • Priority-List Scheduling in Timed Petri Nets(共著)
    Trans. IEICE of Japan  E75-A-  (10)  1394  -1406  1992

Research Grants & Projects

  • ペトリネットの発火系列探索
    共同研究
  • Finding Legal Firing Sequences of Petri Nets
    Cooperative Research


Copyright © MEDIA FUSION Co.,Ltd. All rights reserved.