{"title":"Towards automatic verification of embedded control software","authors":"N. Bauer, Ralf Huuck","doi":"10.1109/APAQS.2001.990043","DOIUrl":null,"url":null,"abstract":"The language: sequential function charts (SFC), is a programming and structuring language for programmable logic controllers (PLC). It is defined in the IEC 61131-3 standard and includes various interesting concepts such as parallelism, hierarchy, priorities, and activity manipulation. Although SFCs are perpetually used in the engineering community for programming and the design of embedded control systems, there are hardly any specific verification approaches for them. Existing approaches for Petri nets, Grafcets, or (UML-)Statecharts do not really apply to SFCs, whose structures are similar but include distinct features. We present a method to model-check SFCs. This is done by defining a translation of SFCs into the native language of the Cadence Symbolic Model Verifier (CaSMV). This translation is specifically tailored to cover all the concepts of SFCs and can be performed automatically. Moreover, we demonstrate our approach by an application to a control process in chemical engineering.","PeriodicalId":145151,"journal":{"name":"Proceedings Second Asia-Pacific Conference on Quality Software","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Second Asia-Pacific Conference on Quality Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APAQS.2001.990043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
The language: sequential function charts (SFC), is a programming and structuring language for programmable logic controllers (PLC). It is defined in the IEC 61131-3 standard and includes various interesting concepts such as parallelism, hierarchy, priorities, and activity manipulation. Although SFCs are perpetually used in the engineering community for programming and the design of embedded control systems, there are hardly any specific verification approaches for them. Existing approaches for Petri nets, Grafcets, or (UML-)Statecharts do not really apply to SFCs, whose structures are similar but include distinct features. We present a method to model-check SFCs. This is done by defining a translation of SFCs into the native language of the Cadence Symbolic Model Verifier (CaSMV). This translation is specifically tailored to cover all the concepts of SFCs and can be performed automatically. Moreover, we demonstrate our approach by an application to a control process in chemical engineering.