World renowned leaders in the field provide an accessible introduction to the use of Generalized Stochastic Petri Nets (GSPNs) for the performance analysis of diverse distributed systems. Divided into two parts, it begins with a summary of the major results in GSPN theory. The second section is devoted entirely to application examples which demonstrate how GSPN methodology can be used in different arenas. A simple version of the software tool used to analyse GSPN models is included with the book and a concise manual for its use is presented in the later chapters.
Written by a leading researcher this book presents an introduction to Stochastic Petri Nets covering the modeling power of the proposed SPN model, the stability conditions and the simulation methods. Its unique and well-written approach provides a timely and important addition to the literature. Appeals to a wide range of researchers in engineering, computer science, mathematics and OR.
Driven by the request for increased productivity, flexibility, and competitiveness, modern civilization increasingly has created high-performance discrete event dynamic systems (DEDSs). These systems exhibit concurrent, sequential, competitive activities among their components. They are often complex and large in scale, and necessarily flexible and thus highly capital-intensive. Examples of systems are manufacturing systems, communication networks, traffic and logistic systems, and military command and control systems. Modeling and performance evaluation play a vital role in the design and operation of such high-performance DEDSs and thus have received widespread attention from researchers over the past two decades. One methodology resulting from this effort is based on timed Petri nets and related graphical and mathematical tools. The popularity that Petri nets have been gaining in modeling of DEDSs is due to their powerful representational ability of concurrency and synchronization; however these properties of DEDSs cannot be expressed easily in traditional formalisms developed for analysis of `classical' systems with sequential behaviors. This book introduces the theories and applications of timed Petri nets systematically. Moreover, it also presents many practical applications in addition to theoretical developments, together with the latest research results and industrial applications of timed Petri nets. Timed Petri Nets: Theory and Application is intended for use by researchers and practitioners in the area of Discrete Event Dynamic Systems.
Any developer of discrete event systems knows that the most important quality of the final system is that it be functionally correct by exhibiting certain functionaL or qualitative properties decided upon as being important. Once assured that the system behaves correctly, it is also important that it is efficient in that its running cost is minimal or that it executes in optimum time or whatever performance measure is chosen. While functional correctness is taken for granted, the latter quantitative properties will often decide the success, or otherwise, of the system. Ideally the developer must be able to specify, design and implement his system and test it for both functional correctness and performance using only one for malism. No such formalism exists as yet. In recent years the graphical version of the Specification and Description Language (SDL) has become very popular for the specification, design and partial implementation of discrete systems. The ability to test for functional correctness of systems specified in SDL is, however, limited to time consuming simulative executions of the specification and perfor mance analysis is not directly possible. Petri nets, although graphical in format are somewhat tedious for specifying large complex systems but, on the other hand were developed exactly to test discrete, distributed systems for functional correctness. With a Petri net specification one can test, e. g. , for deadlock, live ness and boundedness of the specified system.
The Handbook of Software Aging and Rejuvenation provides a comprehensive overview of the subject, making it indispensable to graduate students as well as professionals in the field. It begins by introducing fundamental concepts, definitions, and the history of software aging and rejuvenation research, followed by methods, tools, and strategies that can be used to detect, analyze, and overcome software aging.
This book presents the definition, validation and application of a selected set of Petri nets. It first introduces the basic models including time and stochastic extensions, in particular place-transition and high level Petri nets. Their modeling and design capabilities are illustrated by a set of representations of interest in operating and communication systems. The volume then addresses the related verification problems and proposes corresponding solutions by introducing the main notions needed to fully understand the behavior and properties behind Petri nets. Particular attention is devoted to how systems can be fully represented and analyzed in terms of their behavioral, time and stochastic aspects by using the same formal approach and semantical basis. Finally, illustrative examples are presented in the important fields of interoperability in telecommunication services, programmation languages, multimedia architectures, manufacturing systems and communication protocols.
This book constitutes the refereed proceedings of the 11th International Conference on Modelling Tools and Techniques for Computer Communication System Performance Evaluation, TOOLS 2000, held in Schaumburg, IL, USA in March 2000. The 21 revised full papers presented were carefully reviewed and selected from a total of 49 submissions. Also included are 15 tool descriptions and one invited paper. The papers are organized in topical sections on queueing network models, optimization in mobile networks, stochastic Petri nets, simulation, formal methods and performance evaluation, and measurement tools and applications.
We introduce the theory of chemical reaction networks and their relation to stochastic Petri nets — important ways of modeling population biology and many other fields. We explain how techniques from quantum mechanics can be used to study these models. This relies on a profound and still mysterious analogy between quantum theory and probability theory, which we explore in detail. We also give a tour of key results concerning chemical reaction networks and Petri nets.
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.
Algorithm 396 A.4.6 General Execution Policies 398 A.5 Transient Analysis of DSPNs 401 A.5.1 Solution Algorithm for Periodic DSPNs 401 A.5.2 Solution Algorithm for Non-periodic DSPNs 403 List of Abbreviations 407 Glossary of Notation 411 References 419 Index 433.
