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.

Using formal methods for the specification and verification of hardware and software systems is becoming increasingly important as systems increase in size and complexity. The aim of the book is to illustrate progress in formal methods based on Petri net formalisms. It presents both practical and theoretical foundations for the use of Petri nets in complex system engineering tasks. In doing so it bridges the gap between Petri nets and the systems modeling and implementation process. It contains a collection of examples arising from different fields, such as flexible manufacturing, telecommunication and workflow management systems.

M. Silva Significant changes have been occurring in industrialized countries since the Second World War. Production is moving towards sophisticated high qUality products, economy of scale has been replaced by economy of scope, jerky demands are progressively replacing steady demands, and competi tiveness is becoming a worldwide phenomenon. These trends require highly automated manufacturing systems with small set-up times and high flex ibility. As a consequence, implementation and running costs of modem manufacturing systems are drastically increasing, whereas their fields of application remain limited, and every day become even narrower, which increases the risk of early obsolescence. This is the reason why designers are trying to improve the preliminary design phase, also known as the 'paper study phase'. The preliminary design phase includes, but is not limited to, the func tional specification, and the evaluation of the system. Many tools exist to support the functional specification of manufactur ing systems. IDEFO is one of these tools. It leads, using a top-down ap proach, to a precise functional description of the required system. However, its use cannot be extended further. In general, the evaluation starts with a modeling step, which depends on the evaluation tool used, and ends by applying the model to find out its main dynamic characteristics. Two main approaches can be used to perform this task, namely simulation and math ematical approach. Using simulation, the modeling tool is either a classical computer language, or a simulation language.

With their intuitive graphical approach and expressive analysis techniques, Petri nets are suitable for a wide range of applications and teaching scenarios, and they have gained wide acceptance as a modeling technique in areas such as software design and control engineering. The core theoretical principles have been studied for many decades and there is now a comprehensive research literature that complements the extensive implementation experience. In this book the author presents a clear, thorough introduction to the essentials of Petri nets. He explains the core modeling techniques and analysis methods and he illustrates their usefulness with examples and case studies. Part I describes how to use Petri nets for modeling; all concepts are explained with the help of examples, starting with a generic, powerful model which is also intuitive and realistic. Part II covers the essential analysis methods that are specific to Petri nets, introducing techniques used to formulate key properties of system nets and algorithms for proving their validity. Part III presents case studies, each introducing new concepts, properties and analysis techniques required for very different modeling tasks. The author offers different paths among the chapters and sections: the elementary strand for readers who wish to study only elementary nets; the modeling strand for those who wish to study the modeling but not the analysis of systems; and finally the elementary models of the modeling strand for those interested in technically simple, but challenging examples and case studies. The author achieves an excellent balance between consistency, comprehensibility and correctness in a book of distinctive design. Among its characteristics, formal arguments are reduced to a minimum in the main text with many of the theoretical formalisms moved to an appendix, the explanations are supported throughout with fully integrated graphical illustrations, and each chapter ends with exercises and recommendations for further reading. The book is suitable for students of computer science and related subjects such as engineering, and for a broad range of researchers and practitioners.

The stepwise refinement method postulates a system construction route that starts with a high-level specification, goes through a number of provably correct development steps, and ends with an executable program. The contributions to this volume survey the state of the art in this extremely active research area. The world's leading specialists in concurrent program specification, verification, and the theory of their refinement present latest research results and surveys of the fields. State-based, algebraic, temporal logic oriented and category theory oriented approaches are presented. Special attention is paid to the relationship between compositionality and refinement for distributed programs. Surveys are given of results on refinement in partial-order based approaches to concurrency. A unified treatment is given of the assumption/commitment paradigm in compositional concurrent program specification and verification, and the extension of these to liveness properties. Latest results are presented on specifying and proving concurrent data bases correct, and deriving network protocols from their specifications.