Authors among key contributors to this research area
Extensively covers theory and algorithms, and provides good insight into applications
Rich, reliable source of problems for graduate students and experienced researchers
Dr. Eric Badouel is a researcher at IRISA/INRIA Rennes–Bretagne Atlantique in Rennes. His research interests include concurrency and Petri nets.
Dr. Luca Bernardinello is a researcher in the Dipartimento di Informatica, Sistemistica e Comunicazione of the Università degli studi di Milano-Bicocca. His research interests include concurrency and Petri nets.
Dr. Philippe Darondeau was a researcher at IRISA/INRIA Rennes–Bretagne Atlantique in Rennes. His research interests included concurrency and Petri nets. Dr. Darondeau passed away in 2013, during the final writing of the book.
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.
Introduction.- Introduction to Elementary Net Synthesis.- Other Forms of the Synthesis Problem.- Algorithms of Elementary Net Synthesis.- Variations of Elementary Net Synthesis.- A Unified Theory of Net Synthesis.- The Linear Algebraic Structure of Regions.- Synthesis of P/T-Nets from Finite Initialized Transition Systems.- Synthesis of Unbounded P/T-Nets.- P/T-Nets with the Step Firing Rule.- Extracting Concurrency from Transition Systems.- Process Discovery.- Supervisory Control.- Design of Speed Independent Circuits.- Bibliography.
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-nets 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.
"By reading, studying and perhaps using the book Petri net synthesis as a textbook for a course, one takes an interesting and adventurous journey in the field of relating behavioural and structural deillegalscriptions of concurrent systems. Petri net synthesis is the best candidate to be a reference book in this field, and reading it is a great pleasure. ... book is organized in such a way that it can be used as a textbook for several master courses ... .” (Giovanni Michele Pinna, Mathematical Reviews, January, 2017)
"This book provides an impressive in-depth account of a wide range of the results and techniques for Petri net synthesis. It covers both theory and algorithms and provides a good insight into applications. It is valuable for novices as well as for researchers as a rich and reliable reference as well as a source of relevant research problems.” (Jörg Desel, zbMATH 1351.68003, 2017)
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 inPart 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.
"By reading, studying and perhaps using the book Petri net synthesis as a textbook for a course, one takes an interesting and adventurous journey in the field of relating behavioural and structural deillegalscriptions of concurrent systems. Petri net synthesis is the best candidate to be a reference book in this field, and reading it is a great pleasure. ... book is organized in such a way that it can be used as a textbook for several master courses ... ." (Giovanni Michele Pinna, Mathematical Reviews, January, 2017)
"This book provides an impressive in-depth account of a wide range of the results and techniques for Petri net synthesis. It covers both theory and algorithms and provides a good insight into applications. It is valuable for novices as well as for researchers as a rich and reliable reference as well as a source of relevant research problems." (Jörg Desel, zbMATH 1351.68003, 2017)
Dr. Eric Badouel is a researcher at IRISA/INRIA Rennes-Bretagne Atlantique in Rennes. His research interests include concurrency and Petri nets.
Dr. Luca Bernardinello is a researcher in the Dipartimento di Informatica, Sistemistica e Comunicazione of the Università degli studi di Milano-Bicocca. His research interests include concurrency and Petri nets.
Dr. Philippe Darondeau was a researcher at IRISA/INRIA Rennes-Bretagne Atlantique in Rennes. His research interests included concurrency and Petri nets. Dr. Darondeau passed away in 2013, during the final writing of the book.
Über den Autor
Dr. Eric Badouel is a researcher at IRISA/INRIA Rennes-Bretagne Atlantique in Rennes. His research interests include concurrency and Petri nets.
Dr. Luca Bernardinello is a researcher in the Dipartimento di Informatica, Sistemistica e Comunicazione of the Università degli studi di Milano-Bicocca. His research interests include concurrency and Petri nets.
Dr. Philippe Darondeau was a researcher at IRISA/INRIA Rennes-Bretagne Atlantique in Rennes. His research interests included concurrency and Petri nets. Dr. Darondeau passed away in 2013, during the final writing of the book.
Inhaltsverzeichnis
Introduction.- Introduction to Elementary Net Synthesis.- Other Forms of the Synthesis Problem.- Algorithms of Elementary Net Synthesis.- Variations of Elementary Net Synthesis.- A Unified Theory of Net Synthesis.- The Linear Algebraic Structure of Regions.- Synthesis of P/T-Nets from Finite Initialized Transition Systems.- Synthesis of Unbounded P/T-Nets.- P/T-Nets with the Step Firing Rule.- Extracting Concurrency from Transition Systems.- Process Discovery.- Supervisory Control.- Design of Speed Independent Circuits.- Bibliography.
Klappentext
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 inPart 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.
Authors among key contributors to this research area
Extensively covers theory and algorithms, and provides good insight into applications
Rich, reliable source of problems for graduate students and experienced researchers
