時間論理によるラダー図からSFCへの変換法 Transformation Algorithm from Ladder Diagram to SFC Using Temporal Logic

この論文にアクセスする

この論文をさがす

著者

抄録

Ladder Diagram (LD) has been widely used in industries as a language for sequential controls. However, the LD can not represent sequential flows of control logics explicitly. This leads to difficulties in understanding the control logics for other engineers. To overcome this problem, Sequential Function Chart (SFC) has been proposed. As the SFC can represent the sequential flow explicitly, it is expected to be used more widely. As many knowhows have been required in the LD, it is necessary to develop a transformation algorithm from LD to SFC. In this paper, a technique to transform LD to the corresponding SFC by using Temporal Logic is proposed. In the closed loop system which consists of the controlled plant and LD, the information in the sequence including parallel path divergences is extracted to develop the transformation algorithm. An example is also shown to verify the feasiblity of the proposed algorithm.

収録刊行物

  • 電気学会論文誌. D, 産業応用部門誌 = The transactions of the Institute of Electrical Engineers of Japan. D, A publication of Industry Applications Society  

    電気学会論文誌. D, 産業応用部門誌 = The transactions of the Institute of Electrical Engineers of Japan. D, A publication of Industry Applications Society 117(12), 1471-1479, 1997-12-01 

    The Institute of Electrical Engineers of Japan

参考文献:  18件

参考文献を見るにはログインが必要です。ユーザIDをお持ちでない方は新規登録してください。

被引用文献:  8件

被引用文献を見るにはログインが必要です。ユーザIDをお持ちでない方は新規登録してください。

各種コード

  • NII論文ID(NAID)
    10002725761
  • NII書誌ID(NCID)
    AN10012320
  • 本文言語コード
    JPN
  • 資料種別
    ART
  • ISSN
    09136339
  • NDL 記事登録ID
    4353653
  • NDL 雑誌分類
    ZN31(科学技術--電気工学・電気機械工業)
  • NDL 請求記号
    Z16-1608
  • データ提供元
    CJP書誌  CJP引用  NDL  J-STAGE 
ページトップへ