{"title":"Checking time Petri nets for linear duration properties","authors":"Xuandong Li, J. Lilius","doi":"10.1109/PNPM.1999.796568","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796568","url":null,"abstract":"In this paper, we consider the problem of checking 1-safe time Petri nets for linear duration properties, which are linear inequalities on integrated durations of system states. By showing that a 1-safe time Petri net satisfies a linear duration property if and only if its integral behaviour satisfies the linear duration property, we can give an algorithm that solves the problem based on investigating the integral state space of the 1-safe time Petri net. The algorithm is also improved to avoid exhaustive investigation of the state space.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131455439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Valero Ruiz, D. de Frutos Escrig, F. Cuartero Gomez
{"title":"On non-decidability of reachability for timed-arc Petri nets","authors":"V. Valero Ruiz, D. de Frutos Escrig, F. Cuartero Gomez","doi":"10.1109/PNPM.1999.796565","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796565","url":null,"abstract":"Timed-arc Petri nets are not Turing powerful, because, in particular, they cannot simulate a counter with test on zero. Thus, we could think that this model does not extend significantly the expressiveness of untimed Petri nets. But this is not true; in this paper we show that the differences between them are big enough to make the reachability problem undecidable. We also define dead tokens as those that cannot be used for firing any transitions in the future and we present some particular cases where we can identify them on this kind of timed nets.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122013545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}