Petri Nets Properties, Analysis and ApplicationsPetri网的性能分析与应用.pptVIP

下载本文档

6
0
约1.55万字
约 59页
2017-03-08 发布于上海
举报
版权申诉

Petri Nets Properties, Analysis and ApplicationsPetri网的性能分析与应用.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Petri Nets Properties, Analysis and ApplicationsPetri网的性能分析与应用

Petri Nets: Properties, Analysis and Applications Gabriel Eirea UC Berkeley 10/8/02 Based on paper by T. Murata Outline Introduction/History Transition enabling firing Modeling examples Behavioral properties Analysis methods Liveness, safeness reachability Analysis synthesis of Marked Graphs Structural properties Modified Petri Nets Introduction Petri Nets concurrent, asynchronous, distributed, parallel, nondeterministic and/or stochastic systems graphical tool visual communication aid mathematical tool state equations, algebraic equations, etc communication between theoreticians and practitioners History 1962: C.A. Petri’s dissertation (U. Darmstadt, W. Germany) 1970: Project MAC Conf. on Concurrent Systems and Parallel Computation (MIT, USA) 1975: Conf. on Petri Nets and related Methods (MIT, USA) 1979: Course on General Net Theory of Processes and Systems (Hamburg, W. Germany) 1980: First European Workshop on Applications and Theory of Petri Nets (Strasbourg, France) 1985: First International Workshop on Timed Petri Nets (Torino, Italy) Applications performance evaluation communication protocols distributed-software systems distributed-database systems concurrent and parallel programs industrial control systems discrete-events systems multiprocessor memory systems dataflow-computing systems fault-tolerant systems etc, etc, etc Definition Directed, weighted, bipartite graph places transitions arcs (places to transitions or transitions to places) weights associated with each arc Initial marking assigns a non-negative integer to each place Transition (firing) rule A transition t is enabled if each input place p has at least w(p,t) tokens An enabled transition may or may not fire A firing on an enabled transition t removes w(p,t) from each input place p, and adds w(t,p’) to each output place p’ Firing example 2H2 + O2 ? 2H2O Firing example 2H2 + O2 ? 2H2O Some definitions source transition: no inputs sink transition: no outputs self-loop: a pair (p,t) s.t. p i