{"title":"带延迟位的Petri网的状态方程","authors":"Matthias Werner, Gero Mühl","doi":"10.1109/ECBS.2006.16","DOIUrl":null,"url":null,"abstract":"There exist several ways to augment Petri nets with time. The most popular approach is to assign times to transitions as time Petri nets (Merlin, 1974) or timed Petri nets (Ramchandani, 1974) do. It is, however, also possible to augment places, edges, or tokens of a Petri net with time. Within this paper we consider Petri nets with time augmented places as introduced in Coolahan and Roussopoulos (1983) which we call Petri nets with delaying places (PNDP). We present an approach that allows non-reachability to be proved in PNDP's using a state equation. Due to a lack of space, we only present our main results","PeriodicalId":430872,"journal":{"name":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A state equation for Petri nets with delaying places\",\"authors\":\"Matthias Werner, Gero Mühl\",\"doi\":\"10.1109/ECBS.2006.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There exist several ways to augment Petri nets with time. The most popular approach is to assign times to transitions as time Petri nets (Merlin, 1974) or timed Petri nets (Ramchandani, 1974) do. It is, however, also possible to augment places, edges, or tokens of a Petri net with time. Within this paper we consider Petri nets with time augmented places as introduced in Coolahan and Roussopoulos (1983) which we call Petri nets with delaying places (PNDP). We present an approach that allows non-reachability to be proved in PNDP's using a state equation. Due to a lack of space, we only present our main results\",\"PeriodicalId\":430872,\"journal\":{\"name\":\"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECBS.2006.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECBS.2006.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A state equation for Petri nets with delaying places
There exist several ways to augment Petri nets with time. The most popular approach is to assign times to transitions as time Petri nets (Merlin, 1974) or timed Petri nets (Ramchandani, 1974) do. It is, however, also possible to augment places, edges, or tokens of a Petri net with time. Within this paper we consider Petri nets with time augmented places as introduced in Coolahan and Roussopoulos (1983) which we call Petri nets with delaying places (PNDP). We present an approach that allows non-reachability to be proved in PNDP's using a state equation. Due to a lack of space, we only present our main results
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
