GRAFCET语言的两种证明方法

P Le Parc, B Queguineur, L Marcé
{"title":"GRAFCET语言的两种证明方法","authors":"P Le Parc,&nbsp;B Queguineur,&nbsp;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,&nbsp;B Queguineur,&nbsp;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}
引用次数: 0

摘要

在本文中,我们提出了两种不同的方法来对gaff - cet语言进行证明。第一个是基于过渡系统,第二个是基于多项式动力系统。从理论和实践两个方面进行了阐述。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Two proof methods for the GRAFCET language

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信