Matthias Werner, L. Popova-Zeugmann, Mario Haustein, E. Pelz
{"title":"时间Petri网的整体状态方程","authors":"Matthias Werner, L. Popova-Zeugmann, Mario Haustein, E. Pelz","doi":"10.3233/FI-2014-1078","DOIUrl":null,"url":null,"abstract":"In this paper we investigate Timed Petri nets (TPN) with fixed, possibly zero, durations and maximal step semantics. We define a new state representation where a state is a pair of a marking for the places and a marking for the transitions (a matrix of clocks). For this representation of states we provide an algebraic state equation. Such a state equation lets us prove a sufficient condition for the non-reachability of a state in a TPN. This application of the state equation is subsequently illustrated by an example.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Holistic State Equation for Timed Petri Nets\",\"authors\":\"Matthias Werner, L. Popova-Zeugmann, Mario Haustein, E. Pelz\",\"doi\":\"10.3233/FI-2014-1078\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we investigate Timed Petri nets (TPN) with fixed, possibly zero, durations and maximal step semantics. We define a new state representation where a state is a pair of a marking for the places and a marking for the transitions (a matrix of clocks). For this representation of states we provide an algebraic state equation. Such a state equation lets us prove a sufficient condition for the non-reachability of a state in a TPN. This application of the state equation is subsequently illustrated by an example.\",\"PeriodicalId\":286395,\"journal\":{\"name\":\"International Workshop on Concurrency, Specification and Programming\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Concurrency, Specification and Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/FI-2014-1078\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Concurrency, Specification and Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/FI-2014-1078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we investigate Timed Petri nets (TPN) with fixed, possibly zero, durations and maximal step semantics. We define a new state representation where a state is a pair of a marking for the places and a marking for the transitions (a matrix of clocks). For this representation of states we provide an algebraic state equation. Such a state equation lets us prove a sufficient condition for the non-reachability of a state in a TPN. This application of the state equation is subsequently illustrated by an example.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
