{"title":"可达树同态于完全布尔格的断连1-安全Petri网","authors":"Sangita Kansal, G. Singh, M. Acharya","doi":"10.1109/PACC.2011.5979037","DOIUrl":null,"url":null,"abstract":"Petri nets generating all the 2^n binary n-vectors as their marking vectors are not only of theoretical interest but also are of practical importance. In this note, we demonstrate the existence of a disconnected 1-safe Petri net whose reachability tree is homomorphic to the n-dimensional complete lattice L_n. This makes the problem of characterizing the 1-safe Petri nets that generate all the binary n-vectors as marking vectors exactly once appear more intricate.","PeriodicalId":403612,"journal":{"name":"2011 International Conference on Process Automation, Control and Computing","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Disconnected 1-Safe Petri Net Whose Reachability Tree Is Homomorphic to a Complete Boolean Lattice\",\"authors\":\"Sangita Kansal, G. Singh, M. Acharya\",\"doi\":\"10.1109/PACC.2011.5979037\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Petri nets generating all the 2^n binary n-vectors as their marking vectors are not only of theoretical interest but also are of practical importance. In this note, we demonstrate the existence of a disconnected 1-safe Petri net whose reachability tree is homomorphic to the n-dimensional complete lattice L_n. This makes the problem of characterizing the 1-safe Petri nets that generate all the binary n-vectors as marking vectors exactly once appear more intricate.\",\"PeriodicalId\":403612,\"journal\":{\"name\":\"2011 International Conference on Process Automation, Control and Computing\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Process Automation, Control and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACC.2011.5979037\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Process Automation, Control and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACC.2011.5979037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Disconnected 1-Safe Petri Net Whose Reachability Tree Is Homomorphic to a Complete Boolean Lattice
Petri nets generating all the 2^n binary n-vectors as their marking vectors are not only of theoretical interest but also are of practical importance. In this note, we demonstrate the existence of a disconnected 1-safe Petri net whose reachability tree is homomorphic to the n-dimensional complete lattice L_n. This makes the problem of characterizing the 1-safe Petri nets that generate all the binary n-vectors as marking vectors exactly once appear more intricate.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
