{"title":"An extraction method of control flow from ladder diagram by judgement of transfer frequency","authors":"N. Shoji, Y. Ikkai, N. Komoda","doi":"10.1109/ETFA.1999.813140","DOIUrl":null,"url":null,"abstract":"In sequential controllers of plants, the ladder diagram is one of the major programming languages. However, it is difficult to understand its control sequences and to maintain them because ladder diagrams do not clearly represent the sequence of plant behavior. The Sequential Function Chart (SFC), which is based on the Petri net, has recently spread as a powerful graphical description of sequential logic. SFC can represent clearly the sequence of control programs. Therefore, a method to translate ladder diagrams to SFC is required. A control sequence extraction method is proposed. In this method, a tentative SFC is created by searching all possible states by using transitions in the ladder diagram. However, the tentative SFC description is complicated because of the existence of non-order control, which does not depend on a fixed sequence, for example manual control. Therefore, the sequential flow of plant behavior in the tentative SFC is extracted according to the difference of transfer frequency between order control and non-order control. Through an application of the proposed method to a practical plant model, it is confirmed that the adequate sequence which represents the original plant behaviour is extracted from the ladder diagram.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.1999.813140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In sequential controllers of plants, the ladder diagram is one of the major programming languages. However, it is difficult to understand its control sequences and to maintain them because ladder diagrams do not clearly represent the sequence of plant behavior. The Sequential Function Chart (SFC), which is based on the Petri net, has recently spread as a powerful graphical description of sequential logic. SFC can represent clearly the sequence of control programs. Therefore, a method to translate ladder diagrams to SFC is required. A control sequence extraction method is proposed. In this method, a tentative SFC is created by searching all possible states by using transitions in the ladder diagram. However, the tentative SFC description is complicated because of the existence of non-order control, which does not depend on a fixed sequence, for example manual control. Therefore, the sequential flow of plant behavior in the tentative SFC is extracted according to the difference of transfer frequency between order control and non-order control. Through an application of the proposed method to a practical plant model, it is confirmed that the adequate sequence which represents the original plant behaviour is extracted from the ladder diagram.