LEADER 05029nam 22006735 450 001 9910805576003321 005 20240322021538.0 010 $a3-031-48278-6 024 7 $a10.1007/978-3-031-48278-6 035 $a(MiAaPQ)EBC31084401 035 $a(Au-PeEL)EBL31084401 035 $a(DE-He213)978-3-031-48278-6 035 $a(MiAaPQ)EBC31093852 035 $a(Au-PeEL)EBL31093852 035 $a(CKB)30112950400041 035 $a(EXLCZ)9930112950400041 100 $a20240123d2024 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aPetri Net Primer $eA Compendium on the Core Model, Analysis, and Synthesis /$fby Eike Best, Raymond Devillers 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Birkhäuser,$d2024. 215 $a1 online resource (548 pages) 225 1 $aComputer Science Foundations and Applied Logic,$x2731-5762 311 08$aPrint version: Best, Eike Petri Net Primer Cham : Birkhäuser Boston,c2024 9783031482779 327 $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. 330 $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. 410 0$aComputer Science Foundations and Applied Logic,$x2731-5762 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aDynamical systems 606 $aMathematical models 606 $aStochastic models 606 $aDiscrete Mathematics in Computer Science 606 $aDynamical Systems 606 $aMathematical Modeling and Industrial Mathematics 606 $aStochastic Modelling 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aDynamical systems. 615 0$aMathematical models. 615 0$aStochastic models. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aDynamical Systems. 615 24$aMathematical Modeling and Industrial Mathematics. 615 24$aStochastic Modelling. 676 $a004.0151 700 $aBest$b Eike$01589015 701 $aDevillers$b Raymond$01589016 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910805576003321 996 $aPetri Net Primer$93883255 997 $aUNINA