A state equation for Petri nets with delaying places

Matthias Werner, Gero Mühl
{"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}
引用次数: 1

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
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
带延迟位的Petri网的状态方程
随着时间的推移,有几种方法可以增强Petri网。最流行的方法是像时间Petri网(Merlin, 1974)或时间Petri网(Ramchandani, 1974)那样为过渡分配时间。但是,也可以随时间增加Petri网的位置、边缘或标记。在本文中,我们考虑了Coolahan和Roussopoulos(1983)中引入的带时间增广位的Petri网,我们称之为带延迟位的Petri网(PNDP)。我们提出了一种利用状态方程证明PNDP的不可达性的方法。由于篇幅所限,我们只介绍我们的主要结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Rava: designing a Java extension with dynamic object roles Standardized content service system for distributed e-learning resource Requirements engineering for the adviser portal bank system Requirements for distributed mission-critical decision support systems Conceptual patterns
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1