000 03868nam a22005415i 4500
001 978-981-19-6309-4
003 DE-He213
005 20240423125116.0
007 cr nn 008mamaa
008 221103s2022 si | s |||| 0|eng d
020 _a9789811963094
_9978-981-19-6309-4
024 7 _a10.1007/978-981-19-6309-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
100 1 _aLiu, Guanjun.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aPetri Nets
_h[electronic resource] :
_bTheoretical Models and Analysis Methods for Concurrent Systems /
_cby Guanjun Liu.
250 _a1st ed. 2022.
264 1 _aSingapore :
_bSpringer Nature Singapore :
_bImprint: Springer,
_c2022.
300 _aXI, 279 p. 72 illus., 9 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aChapter 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 _aThis 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 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 1 4 _aModels of Computation.
650 2 4 _aSoftware Engineering.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aTheory and Algorithms for Application Domains.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9789811963087
776 0 8 _iPrinted edition:
_z9789811963100
776 0 8 _iPrinted edition:
_z9789811963117
856 4 0 _uhttps://doi.org/10.1007/978-981-19-6309-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cSPRINGER
999 _c174333
_d174333