Petri Net Synthesis

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

Full description

Bibliographic Details
Main Authors: Badouel, Eric, Bernardinello, Luca (Author), Darondeau, Philippe (Author)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2015, 2015
Edition:1st ed. 2015
Series:Texts in Theoretical Computer Science. An EATCS Series
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03300nmm a2200373 u 4500
001 EB001086649
003 EBX01000000000000000846013
005 00000000000000.0
007 cr|||||||||||||||||||||
008 151215 ||| eng
020 |a 9783662479674 
100 1 |a Badouel, Eric 
245 0 0 |a Petri Net Synthesis  |h Elektronische Ressource  |c by Eric Badouel, Luca Bernardinello, Philippe Darondeau 
250 |a 1st ed. 2015 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2015, 2015 
300 |a XIII, 339 p. 140 illus., 1 illus. in color  |b online resource 
505 0 |a 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 
653 |a Software engineering 
653 |a Computer science 
653 |a Mathematics of Computing 
653 |a Computer science / Mathematics 
653 |a Mathematical logic 
653 |a Software Engineering 
653 |a Mathematical Logic and Foundations 
653 |a Theory of Computation 
700 1 |a Bernardinello, Luca  |e [author] 
700 1 |a Darondeau, Philippe  |e [author] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Texts in Theoretical Computer Science. An EATCS Series 
028 5 0 |a 10.1007/978-3-662-47967-4 
856 4 0 |u https://doi.org/10.1007/978-3-662-47967-4?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.0151 
520 |a 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-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