04784nam a22005415i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003500118050001500153050001200168072001700180072001600197072002300213072001600236072001500252100007300267245013900340250001800479264007300497300006700570336002600637337002600663338003600689347002400725490006300749505089900812520189201711650003503603650002603638650002303664650002503687650002303712650004603735650002303781650005403804650002603858700008103884710003403965773002603999776003604025776003604061776003604097830006304133856004604196978-3-031-48278-6DE-He21320251030111400.0cr nn 008mamaa240123s2024    sz |    s    |||| 0|eng d  a97830314827867 a10.1007/978-3-031-48278-62doi 4aQA76.9.M35 4aQA297.4 7aUYAM2bicssc 7aPBD2bicssc 7aCOM0140002bisacsh 7aUYAM2thema 7aPBD2thema1 aBest, Eike.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut10aPetri Net Primerh[electronic resource] :bA Compendium on the Core Model, Analysis, and Synthesis /cby Eike Best, Raymond Devillers.  a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Birkhäuser,c2024.  aXIII, 545 p. 241 illus., 31 illus. in color.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aComputer Science Foundations and Applied Logic,x2731-57620 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.  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. 0aComputer sciencexMathematics. 0aDiscrete mathematics. 0aDynamical systems. 0aMathematical models. 0aStochastic models.14aDiscrete Mathematics in Computer Science.24aDynamical Systems.24aMathematical Modeling and Industrial Mathematics.24aStochastic Modelling.1 aDevillers, Raymond.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut2 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303148277908iPrinted edition:z978303148279308iPrinted edition:z9783031482809 0aComputer Science Foundations and Applied Logic,x2731-576240uhttps://doi.org/10.1007/978-3-031-48278-6