Eike BestBorn in 1951 in Germany, graduated in Informatik in 1974 at the Technische Hochschule Karlsruhe. He has joined projects led by Peter Lauer and Brian Randell at the University of Newcastle upon Tyne (1975-1981) where he started to cooperate with Raymond Devillers. He earned his PhD in 1982 at Newcastle and a Habilitation degree at the University of Bonn in 1988 while working at Carl Adam Petri's Institute. He has taught a range of computer science courses as a professor in Paderborn, Hildesheim, and Oldenburg (from 1996), and he has a research and project leadership record, with an emphasis on semantics and Petri nets. Raymond Devillers Born in 1945 in Belgium, graduated in Mathematics and Physics, he got a PhD Thesis in 1974 on the use of games for deadlock prevention at the University of Brussels. During a postdoctorate stay in Newcastle upon Tyne, he met Eike Best, start of a long-lasting cooperation. After a job at the Computer Center of the ULB, he started a professorial career at the same university, where he taught many different courses in practical and theoretical computer sciences. He conducted many researches, in particular about the analysis and synthesis of Petri nets, before and after his retirement in 2010.

“The book describes Petri nets, the computation-friendly models. It prepares readers for the theory side of Petri nets. The basics, properties, and major application of program verification are discussed. Its textbook format consists of the gradual unfolding of the theory of Petri nets, with exercises at the end of each chapter. Undergraduate/graduate-level semester courses can use it as a textbook.” (Maulik A. Dave, Computing Reviews, January 6, 2025)

• Preface.- 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

Eike BestBorn in 1951 in Germany, graduated in Informatik in 1974 at the Technische Hochschule Karlsruhe. He has joined projects led by Peter Lauer and Brian Randell at the University of Newcastle upon Tyne (1975-1981) where he started to cooperate with Raymond Devillers. He earned his PhD in 1982 at Newcastle and a Habilitation degree at the University of Bonn in 1988 while working at Carl Adam Petri's Institute. He has taught a range of computer science courses as a professor in Paderborn, Hildesheim, and Oldenburg (from 1996), and he has a research and project leadership record, with an emphasis on semantics and Petri nets. Raymond Devillers Born in 1945 in Belgium, graduated in Mathematics and Physics, he got a PhD Thesis in 1974 on the use of games for deadlock prevention at the University of Brussels. During a postdoctorate stay in Newcastle upon Tyne, he met Eike Best, start of a long-lasting cooperation. After a job at the Computer Center of the ULB, he started a professorial career at the same university, where he taught many different courses in practical and theoretical computer sciences. He conducted many researches, in particular about the analysis and synthesis of Petri nets, before and after his retirement in 2010.

“The book describes Petri nets, the computation-friendly models. It prepares readers for the theory side of Petri nets. The basics, properties, and major application of program verification are discussed. Its textbook format consists of the gradual unfolding of the theory of Petri nets, with exercises at the end of each chapter. Undergraduate/graduate-level semester courses can use it as a textbook.” (Maulik A. Dave, Computing Reviews, January 6, 2025)

• Preface.- 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

Eike BestBorn in 1951 in Germany, graduated in Informatik in 1974 at the Technische Hochschule Karlsruhe. He has joined projects led by Peter Lauer and Brian Randell at the University of Newcastle upon Tyne (1975-1981) where he started to cooperate with Raymond Devillers. He earned his PhD in 1982 at Newcastle and a Habilitation degree at the University of Bonn in 1988 while working at Carl Adam Petri's Institute. He has taught a range of computer science courses as a professor in Paderborn, Hildesheim, and Oldenburg (from 1996), and he has a research and project leadership record, with an emphasis on semantics and Petri nets. Raymond Devillers Born in 1945 in Belgium, graduated in Mathematics and Physics, he got a PhD Thesis in 1974 on the use of games for deadlock prevention at the University of Brussels. During a postdoctorate stay in Newcastle upon Tyne, he met Eike Best, start of a long-lasting cooperation. After a job at the Computer Center of the ULB, he started a professorial career at the same university, where he taught many different courses in practical and theoretical computer sciences. He conducted many researches, in particular about the analysis and synthesis of Petri nets, before and after his retirement in 2010.

“The book describes Petri nets, the computation-friendly models. It prepares readers for the theory side of Petri nets. The basics, properties, and major application of program verification are discussed. Its textbook format consists of the gradual unfolding of the theory of Petri nets, with exercises at the end of each chapter. Undergraduate/graduate-level semester courses can use it as a textbook.” (Maulik A. Dave, Computing Reviews, January 6, 2025)

• Preface.- 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