Gør som tusindvis af andre bogelskere
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.Du kan altid afmelde dig igen.
This book offers an overview of the key ideas of Petri nets, how they were developed, and how they were applied in diverse applications.The chapters in the first part offer individual perspectives on the impact of Petri¿s work. The second part of the book contains personal memories from researchers who collaborated with him closely, in particular they recount his unique personality. The chapters in the third part offer more conventional treatments on various aspects of current Petri net research, and the fourth part examines the wide applications of Petri nets, and the relationships with other domains.The editors and authors are the leading researchers in this domain, and this book will be a valuable insight for researchers in computer science, particularly those engaged with concurrency and distributed systems.
Petri nets provide a formal framework for system modelingand validation which has proven to be very reliable inpractice. This book presents variousnet models appropriatefor designing specific systems, where systems are understoodvery generally as "organizational systems" in whichregulatedflows of objects and information are significant.
Net theory is a theory of systems organization which had its origins, about 20 years ago, in the dissertation of C. The main concern of this book is the presentation of those parts of net theory which can serve as a basis for practical application. By generali zation of these notions a part of the theory of nets is presented.
This book offers a clear, thorough introduction to Petri nets. The explanations are supported throughout with fully integrated graphical illustrations, with only the analysis and verification presented in a formal manner.
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.