000 05129nam a22006255i 4500
001 978-3-031-48278-6
003 DE-He213
005 20251030111400.0
007 cr nn 008mamaa
008 240123s2024 sz | s |||| 0|eng d
020 _a9783031482786
_9978-3-031-48278-6
024 7 _a10.1007/978-3-031-48278-6
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
100 1 _aBest, Eike.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_969814
245 1 0 _aPetri Net Primer
_h[electronic resource] :
_bA Compendium on the Core Model, Analysis, and Synthesis /
_cby Eike Best, Raymond Devillers.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Birkhäuser,
_c2024.
300 _aXIII, 545 p. 241 illus., 31 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aComputer Science Foundations and Applied Logic,
_x2731-5762
505 0 _aPreface -- 1 First Steps in Petri Nets -- 2 Languages of Petri Nets -- 3 Reachability and Coverability -- 4 Linear-algebraic Structure of Petri Nets -- 5 Graph-theoretical Structure of Petri Nets -- 6 More Structure Theory -- 7 Program Verification Using Traps -- 8 Fairness, Simulations, and Inhibitor Arcs -- 9 Unfoldings and Reachability Checking -- 10 Petri Net Computers -- 11 Synthesis of Petri Nets from Labelled Transition Systems -- 12 Persistent Transition Systems and Choice-free Petri Nets -- 13 Divide-and-Conquer Methods for Synthesis -- 14 Marked Graph Synthesis -- 15 Bounded Choice-free Net Synthesis -- 16 Model Checking Safe, Strongly Persistent Petri Nets -- 17 Semilinearity -- 18 Decidability of the reachability problem -- 19 The Box Algebra 1/2: Refinement and Recursion -- 20 The Box Algebra 2/2: Iteration and Data -- 21 High-level Petri Nets -- Biblyography -- Index.
520 _aPetri nets model concurrent and distributed systems where active components communicate through the production and absorption of various kinds of resources. Although the dynamic properties of such systems may be very complex, they may sometimes be connected to the static structure of a Petri net. Many properties are decidable, but their complexity may be huge. It is often opportune to restrict oneself to classes of systems, to partial algorithms, and to similar but simpler properties. Instead of analysing a given system, it is also possible to search for a system satisfying some desired properties by construction. This comprehensive textbook/reference presents and discusses these issues in-depth in the context of one of the most fundamental Petri net models, called place/transition nets. The presentation is fortified by means of many examples and worked exercises. Among topics addressed: • In which order may actions may be generated and scheduled? • What states and configurations may be reached in a concurrent system? • Which interesting classes of systems can be analysed relatively efficiently? • Is it possible to synthesise a system of some class from its behaviour? • How can systems be represented algebraically, compositionally, and concisely? This unique text, based on introductory as well as on advanced courses on distributed systems, will serve as an invaluable guide for students and (future) researchers interested in theoretical—as well as in practical—aspects of Petri nets and related system models. Eike Best has been a full professor (now retired) affiliated to Carl von Ossietzky Universität Oldenburg, Germany. Raymond Devillers has been a full professor (now retired) affiliated to Université Libre de Bruxelles, Belgium. The authors have a long record as collaborators in the fields of Petri nets and the semantics of concurrency.
650 0 _aComputer science
_xMathematics.
_964041
650 0 _aDiscrete mathematics.
650 0 _aDynamical systems.
650 0 _aMathematical models.
_966910
650 0 _aStochastic models.
650 1 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aDynamical Systems.
650 2 4 _aMathematical Modeling and Industrial Mathematics.
_966912
650 2 4 _aStochastic Modelling.
_966662
700 1 _aDevillers, Raymond.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_969815
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031482779
776 0 8 _iPrinted edition:
_z9783031482793
776 0 8 _iPrinted edition:
_z9783031482809
830 0 _aComputer Science Foundations and Applied Logic,
_x2731-5762
_969816
856 4 0 _uhttps://doi.org/10.1007/978-3-031-48278-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
999 _c57276
_d57276