東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Petri nets = theoretical models and ...

Liu, Guanjun.

Linked to FindBook

Google Book

Amazon

博客來

Petri nets = theoretical models and analysis methods for concurrent systems /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Petri nets/ by Guanjun Liu.
Reminder of title:	theoretical models and analysis methods for concurrent systems /
Author:	Liu, Guanjun.
Published:	Singapore :Springer Nature Singapore : : 2022.,
Description:	xi, 279 p. :ill., digital ;24 cm.
[NT 15003449]:	Chapter 1 Elementary Net Systems -- Chapter 2 Structural Characteristics of Petri Nets -- Chapter 3 Petri Nets with Special Structures -- Chapter 4 Petri Nets Modeling Massage Passing and Resource -- Chapter 5 Verifying Computation Tree Logic Based on Petri Nets -- Chapter 6 Knowledge-oriented Petri Nets and Computation Tree Logic of Knowledge -- Chapter 7 Petri Nets with Insecure Places and Secure Bisimulation -- Chapter 8 Time Petri Nets and Time-soundness -- Chapter 9 Timed Computation Tree Logic and Plain Time Petri Nets with Priorities.
Contained By:	Springer Nature eBook
Subject:	Petri nets. -
Online resource:	https://doi.org/10.1007/978-981-19-6309-4
ISBN:	9789811963094

Petri nets = theoretical models and analysis methods for concurrent systems /
Liu, Guanjun.

Petri netstheoretical models and analysis methods for concurrent systems /[electronic resource] :by Guanjun Liu. - Singapore :Springer Nature Singapore :2022. - xi, 279 p. :ill., digital ;24 cm.

Chapter 1 Elementary Net Systems -- Chapter 2 Structural Characteristics of Petri Nets -- Chapter 3 Petri Nets with Special Structures -- Chapter 4 Petri Nets Modeling Massage Passing and Resource -- Chapter 5 Verifying Computation Tree Logic Based on Petri Nets -- Chapter 6 Knowledge-oriented Petri Nets and Computation Tree Logic of Knowledge -- Chapter 7 Petri Nets with Insecure Places and Secure Bisimulation -- Chapter 8 Time Petri Nets and Time-soundness -- Chapter 9 Timed Computation Tree Logic and Plain Time Petri Nets with Priorities.

This book provides essential information on Petri net theory and Petri net-based model checking methods. As for the Petri net theory, it involves the interleaving semantics and concurrency semantics of elementary net systems, some important net structures (e.g., invariant, repetitive vector, siphon, and trap), some classical net subclasses with special structures (e.g., state machine, marked graph, free-choice net,asymmetric-choice net, normal net, and weakly persistent net), and some basic properties (e.g., reachability, liveness, deadlock, and soundness) It also involves four high-level Petri nets: knowledge-oriented Petri nets, Petri nets with insecure places, time Petri nets, and plain time Petri nets with priorities, focusing on different fields of application. As for the model checking methods, this book introduces readers to computation tree logic (CTL), computation tree logic of knowledge (CTLK), and timed computation tree logic (TCTL), as well as Petri net-based methods for checking them.The basic principle of the reduced ordered binary decision diagram (ROBDD) is employed to compress the state space used in these model checking procedures. The book also covers time-soundness for time Petri nets and secure bisimulation for Petri nets with insecure places, both of which are based on the bisimulation theory. As such, it offers an introduction to basic information on bisimulation theory.

ISBN: 9789811963094

Standard No.: 10.1007/978-981-19-6309-4doiSubjects--Topical Terms:

654110
Petri nets.

LC Class. No.: QA267

Dewey Class. No.: 511.35

Petri nets = theoretical models and analysis methods for concurrent systems /
LDR:02944nmm a2200325 a 4500 001 2305448
003 DE-He213
005 20221103183340.0
006 m d
007 cr nn 008maaau
008 230409s2022 si s 0 eng d
020 $a 9789811963094 $q (electronic bk.)
020 $a 9789811963087 $q (paper)
024 7 $a 10.1007/978-981-19-6309-4 $2 doi
035 $a 978-981-19-6309-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 511.35 $2 23
090 $a QA267 $b .L783 2022
100 1 $a Liu, Guanjun. $3 3608520
245 1 0 $a Petri nets $h [electronic resource] : $b theoretical models and analysis methods for concurrent systems / $c by Guanjun Liu.
260 $a Singapore : $b Springer Nature Singapore : $b Imprint: Springer, $c 2022.
300 $a xi, 279 p. : $b ill., digital ; $c 24 cm.
505 0 $a Chapter 1 Elementary Net Systems -- Chapter 2 Structural Characteristics of Petri Nets -- Chapter 3 Petri Nets with Special Structures -- Chapter 4 Petri Nets Modeling Massage Passing and Resource -- Chapter 5 Verifying Computation Tree Logic Based on Petri Nets -- Chapter 6 Knowledge-oriented Petri Nets and Computation Tree Logic of Knowledge -- Chapter 7 Petri Nets with Insecure Places and Secure Bisimulation -- Chapter 8 Time Petri Nets and Time-soundness -- Chapter 9 Timed Computation Tree Logic and Plain Time Petri Nets with Priorities.
520 $a This book provides essential information on Petri net theory and Petri net-based model checking methods. As for the Petri net theory, it involves the interleaving semantics and concurrency semantics of elementary net systems, some important net structures (e.g., invariant, repetitive vector, siphon, and trap), some classical net subclasses with special structures (e.g., state machine, marked graph, free-choice net,asymmetric-choice net, normal net, and weakly persistent net), and some basic properties (e.g., reachability, liveness, deadlock, and soundness) It also involves four high-level Petri nets: knowledge-oriented Petri nets, Petri nets with insecure places, time Petri nets, and plain time Petri nets with priorities, focusing on different fields of application. As for the model checking methods, this book introduces readers to computation tree logic (CTL), computation tree logic of knowledge (CTLK), and timed computation tree logic (TCTL), as well as Petri net-based methods for checking them.The basic principle of the reduced ordered binary decision diagram (ROBDD) is employed to compress the state space used in these model checking procedures. The book also covers time-soundness for time Petri nets and secure bisimulation for Petri nets with insecure places, both of which are based on the bisimulation theory. As such, it offers an introduction to basic information on bisimulation theory.
650 0 $a Petri nets. $3 654110
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-981-19-6309-4
950 $a Computer Science (SpringerNature-11645)