{"title":"GRAFCET语言的两种证明方法","authors":"P Le Parc, B Queguineur, L Marcé","doi":"10.1016/0066-4138(94)90012-4","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we present two different methods to make proofs on the GRAF-CET language. The first one is based on Transition Systems and the second one uses Polynomial Dynamical Systems. Theoretical and pratical aspects are presented.</p></div>","PeriodicalId":100097,"journal":{"name":"Annual Review in Automatic Programming","volume":"18 ","pages":"Pages 61-65"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0066-4138(94)90012-4","citationCount":"0","resultStr":"{\"title\":\"Two proof methods for the GRAFCET language\",\"authors\":\"P Le Parc, B Queguineur, L Marcé\",\"doi\":\"10.1016/0066-4138(94)90012-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, we present two different methods to make proofs on the GRAF-CET language. The first one is based on Transition Systems and the second one uses Polynomial Dynamical Systems. Theoretical and pratical aspects are presented.</p></div>\",\"PeriodicalId\":100097,\"journal\":{\"name\":\"Annual Review in Automatic Programming\",\"volume\":\"18 \",\"pages\":\"Pages 61-65\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0066-4138(94)90012-4\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annual Review in Automatic Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0066413894900124\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Review in Automatic Programming","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0066413894900124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we present two different methods to make proofs on the GRAF-CET language. The first one is based on Transition Systems and the second one uses Polynomial Dynamical Systems. Theoretical and pratical aspects are presented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
