000 03468nam a22003615i 4500
001 394348
003 ES-MaUEC
005 20230102123122.0
007 cr nn 008mamaa
008 221103s2022 si | s |||| 0|eng d
020 _a9789811963094
024 7 _a10.1007/978-981-19-6309-4
_2doi
040 _aES-MaUEC
_bspa
_cES-MaUEC
100 1 _aLiu, Guanjun
_eautor
_0(orcid)0000-0002-7523-4827
_1https://orcid.org/0000-0002-7523-4827
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aPetri Nets
_bTheoretical Models and Analysis Methods for Concurrent Systems
_cby Guanjun Liu
250 _a1st edition 2022
264 1 _aSingapore
_bSpringer International Publishing
_c2022
300 _a1 recurso en línea (XI, 279 páginas)
_b72 ilustraciones, 9 ilustraciones a color
336 _atexto
_btxt
_2rdacontent
337 _aelectrónico
_bc
_2rdamedia
338 _arecurso electrónico
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
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.
776 0 8 _iPrinted edition:
_z9789811963087
776 0 8 _iPrinted edition:
_z9789811963100
776 0 8 _iPrinted edition:
_z9789811963117
856 4 0 _uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-981-19-6309-4
_zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942 _2lcc
_cLE
988 _aSpringer_Computer_2022
999 _c394348
_d394348