| 書目名稱 | Time and Petri Nets | | 編輯 | Louchka Popova-Zeugmann | | 視頻video | http://file.papertrans.cn/926/925473/925473.mp4 | | 概述 | Introduces algorithms that allow the analysis of time-dependent Petri nets.Assumes an undergraduate level of mathematical logic.Based on an established graduate-level course taught in Germany and Fran | | 圖書封面 |  | | 描述 | .At first glance the concepts of time and of Petri nets are quite contrary: while time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and they represent events as concurrent systems. But if we take a closer look at how time and causality are intertwined we realize that there are many possible ways in which time and Petri nets interact. This book takes a closer look at three time-dependent Petri nets: Time Petri nets, Timed Petri nets, and Petri nets with time windows..The author first explains classic Petri nets and their fundamental properties. Then the pivotal contribution of the book is the introduction of different algorithms that allow us to analyze time-dependent Petri nets. For Time Petri nets, the author presents an algorithm that proves the behavioral equivalence of a net where time is designed once with real and once with natural numbers, so we can reduce the state space and consider the integer states exclusively. For Timed Petri nets, the author introduces two time-dependent state equations, providing a sufficient condition for the non-reachability of states, and she also defines a local transformation for conver | | 出版日期 | Textbook 2013 | | 關(guān)鍵詞 | Discrete analyzing algorithms; Petri nets; State equations; Time Petri nets; Time-dependent Petri nets; T | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-41115-1 | | isbn_softcover | 978-3-662-51435-1 | | isbn_ebook | 978-3-642-41115-1 | | copyright | Springer-Verlag Berlin Heidelberg 2013 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-18 03:05
發(fā)表于 2025-3-21 18:15:41
