This book is a comprehensive, systematic survey of the synthesis problem, and of region theory which underlies its solution, covering the related theory, algorithms, and applications. The authors focus on safe Petri nets and place/transition nets (P/T-nets), treating synthesis as an automated process which, given behavioural specifications or partial specifications of a system to be realized, decides whether the specifications are feasible, and then produces a Petri net realizing them exactly, or if this is not possible produces a Petri net realizing an optimal approximation of the specifications. In Part I the authors introduce elementary net synthesis. In Part II they explain variations of elementary net synthesis and the unified theory of net synthesis. The first three chapters of Part III address the linear algebraic structure of regions, synthesis of P/T-nets from finite initialized transition systems, and the synthesis of unbounded P/T-nets. Finally, the last chapter in Part III and the chapters in Part IV cover more advanced topics and applications: P/T-net with the step firing rule, extracting concurrency from transition systems, process discovery, supervisory control, and the design of speed-independent circuits. Most chapters conclude with exercises, and the book is a valuable reference for both graduate students of computer science and electrical engineering and researchers and engineers in this domain.

Petri Net Synthesis for Discrete Event Control of Manufacturing Systems develops two essential resource-sharing concepts: parallel and sequential mutual exclusions and theoretical results in Petri synthesis. A parallel mutual exclusion (PME) is defined to model a resource shared by independent distributed processes, and a sequential mutual exclusion is a sequential composition of PMEs, modeling a resource shared by sequentially-related processes. A hybrid synthesis methodology for Petri net models and controllers is proposed using top-down, modular, and bottom-up design ideas and the mutual exclusion theory. An aggregate Petri net model is refined by replacing places and /or transitions with basic design modules which are mathematically and graphically described. Petri net design methods are presented for such buffers as automatic storage and retrieval systems. Using the proposed method synthesizes both Petri net structure and feasible initial markings, guaranteeing that resulting Petri nets have desirable system properties such as freedom from deadlock and cyclic behavior. A Petri net controller is extended to error recovery for automated manufacturing systems. The theory can guarantee that the desired system properties achieved by the original design will be preserved when the controller is augmented to deal with an error in the prescribed methods. Control code has been directly generated from Petri net definitions. The algorithm and implementation details are given for a flexible manufacturing system. Using the approach presented in Petri Net Synthesis for Discrete Event Control of Manufacturing Systems, engineers and research workers can develop their own discrete event control applications and experiments.

Petri 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.

This book constitutes the proceedings of the 39th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2018, held in Bratislava, Slovakia, in June 2018. Petri Nets 2017 is co-located with the 19th International Conference on Application of Concurrency to System Design, ACSD 2018. The 15 regular and 8 tool papers, with 1 invited talk presented together in this volume were carefully reviewed and selected from 33 submissions. The focus of the conference is on following topics: Petri Nets Synthesis; Analysis and Model Checking; Languages; Semantics and Expressiveness; and Tools.

The 15th volume of ToPNoC contains revised and extended versions of a selection of the best workshop and tutorial papers presented at the 40th International Conference on Application and Theory of Petri Nets and Concurrency, Petri Nets 2019, and the 19th International Conference on Application of Concurrency to System Design, ACSD 2019. The papers cover a diverse range of topics including model checking and system verification, refinement and synthesis; foundational work on specific classes of Petri nets; and innovative applications of Petri nets and other models of concurrency. Application areas covered in this volume are: process mining, verification, formal semantics, communication protocols, business processes, distributed systems, and net synthesis. Thus, this volume gives a good overview of ongoing research on concurrent systems and Petri nets.

Hardware Design and Petri Nets presents a summary of the state of the art in the applications of Petri nets to designing digital systems and circuits. The area of hardware design has traditionally been a fertile field for research in concurrency and Petri nets. Many new ideas about modelling and analysis of concurrent systems, and Petri nets in particular, originated in theory of asynchronous digital circuits. Similarly, the theory and practice of digital circuit design have always recognized Petri nets as a powerful and easy-to-understand modelling tool. The ever-growing demand in the electronic industry for design automation to build various types of computer-based systems creates many opportunities for Petri nets to establish their role of a formal backbone in future tools for constructing systems that are increasingly becoming distributed, concurrent and asynchronous. Petri nets have already proved very effective in supporting algorithms for solving key problems in synthesis of hardware control circuits. However, since the front end to any realistic design flow in the future is likely to rely on more pragmatic Hardware Description Languages (HDLs), such as VHDL and Verilog, it is crucial that Petri nets are well interfaced to such languages. Hardware Design and Petri Nets is divided into five parts, which cover aspects of behavioral modelling, analysis and verification, synthesis from Petri nets and STGs, design environments based on high-level Petri nets and HDLs, and finally performance analysis using Petri nets. Hardware Design and Petri Nets serves as an excellent reference source and may be used as a text for advanced courses on the subject.