Petri网的可观测性

A. Giua, C. Seatzu
{"title":"Petri网的可观测性","authors":"A. Giua, C. Seatzu","doi":"10.1109/CDC.2000.914209","DOIUrl":null,"url":null,"abstract":"We discuss the problem of estimating the marking of a place/transition net based on event observation. We assume that the net structure is known while the initial marking is unknown. We define several observability properties and show how they can be proved. In particular, we set up a hierarchy considering the possibility that the above properties are satisfied by a net N starting from an initial marking M/sub 0/, by a net N starting from any initial marking M reachable from an initial marking M/sub 0/, or by a net N starting from any marking in N/sup m/, where m is the number of places of the net.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Observability properties of Petri nets\",\"authors\":\"A. Giua, C. Seatzu\",\"doi\":\"10.1109/CDC.2000.914209\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We discuss the problem of estimating the marking of a place/transition net based on event observation. We assume that the net structure is known while the initial marking is unknown. We define several observability properties and show how they can be proved. In particular, we set up a hierarchy considering the possibility that the above properties are satisfied by a net N starting from an initial marking M/sub 0/, by a net N starting from any initial marking M reachable from an initial marking M/sub 0/, or by a net N starting from any marking in N/sup m/, where m is the number of places of the net.\",\"PeriodicalId\":217237,\"journal\":{\"name\":\"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)\",\"volume\":\"127 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.2000.914209\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2000.914209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

讨论了基于事件观测的地点/过渡网标记估计问题。我们假设网络结构已知,而初始标记未知。我们定义了几个可观测性性质,并说明了如何证明它们。特别地,我们建立了一个层次结构,考虑从初始标记M/sub 0/开始的网络N,从初始标记M/sub 0/可到达的任何初始标记M开始的网络N,或者从N/sup M/中的任何标记开始的网络N满足上述性质的可能性,其中M是网络的位置数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Observability properties of Petri nets
We discuss the problem of estimating the marking of a place/transition net based on event observation. We assume that the net structure is known while the initial marking is unknown. We define several observability properties and show how they can be proved. In particular, we set up a hierarchy considering the possibility that the above properties are satisfied by a net N starting from an initial marking M/sub 0/, by a net N starting from any initial marking M reachable from an initial marking M/sub 0/, or by a net N starting from any marking in N/sup m/, where m is the number of places of the net.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信