普通的，有界的，可逆的，持久的，和k标记Petri网有标记的图可达图

{"title":"普通的，有界的，可逆的，持久的，和k标记Petri网有标记的图可达图","authors":"E. Best, Harro Wimmel","doi":"10.1007/978-3-319-45994-3_4","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":404583,"journal":{"name":"Reachability Problems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs\",\"authors\":\"E. Best, Harro Wimmel\",\"doi\":\"10.1007/978-3-319-45994-3_4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":404583,\"journal\":{\"name\":\"Reachability Problems\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Reachability Problems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-45994-3_4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Reachability Problems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-45994-3_4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}