{"title":"基于标记流图的顺序控制系统分层规划","authors":"K. Takahashi, K. Hasegawa, P. E. Miyagi","doi":"10.1109/ETFA.1999.813138","DOIUrl":null,"url":null,"abstract":"The authors propose the Mark Flow Graph (MFG) for theoretical systematization of sequential control. The MFG is derived from the Petri net and is suitable for designing and analyzing sequential control systems. We apply the MFG to practical examples. We explain how to use the MFG in hierarchical programming of the systems and show its effectiveness. The MFG can be easily translated to the SFC for programming PCs.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"16 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Hierarchical programming of sequential control systems by mark flow graph\",\"authors\":\"K. Takahashi, K. Hasegawa, P. E. Miyagi\",\"doi\":\"10.1109/ETFA.1999.813138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors propose the Mark Flow Graph (MFG) for theoretical systematization of sequential control. The MFG is derived from the Petri net and is suitable for designing and analyzing sequential control systems. We apply the MFG to practical examples. We explain how to use the MFG in hierarchical programming of the systems and show its effectiveness. The MFG can be easily translated to the SFC for programming PCs.\",\"PeriodicalId\":119106,\"journal\":{\"name\":\"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)\",\"volume\":\"16 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"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.813138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.813138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hierarchical programming of sequential control systems by mark flow graph
The authors propose the Mark Flow Graph (MFG) for theoretical systematization of sequential control. The MFG is derived from the Petri net and is suitable for designing and analyzing sequential control systems. We apply the MFG to practical examples. We explain how to use the MFG in hierarchical programming of the systems and show its effectiveness. The MFG can be easily translated to the SFC for programming PCs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
