國立虎尾科技大學 |

Petri Net Synthesis

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Petri Net Synthesis/ by Eric Badouel, Luca Bernardinello, Philippe Darondeau.
作者:	Badouel, Eric.
其他作者:	Bernardinello, Luca.
面頁冊數:	XIII, 339 p. 140 illus., 1 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computers. -
電子資源:	https://doi.org/10.1007/978-3-662-47967-4
ISBN:	9783662479674

Petri Net Synthesis
Badouel, Eric.

Petri Net Synthesis[electronic resource] /by Eric Badouel, Luca Bernardinello, Philippe Darondeau. - 1st ed. 2015. - XIII, 339 p. 140 illus., 1 illus. in color.online resource. - Texts in Theoretical Computer Science. An EATCS Series,1862-4499. - Texts in Theoretical Computer Science. An EATCS Series,.

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.

ISBN: 9783662479674

Standard No.: 10.1007/978-3-662-47967-4doiSubjects--Topical Terms:

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Petri Net Synthesis
LDR:03483nam a22004335i 4500 001 967105
003 DE-He213
005 20200703132419.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783662479674 $9 978-3-662-47967-4
024 7 $a 10.1007/978-3-662-47967-4 $2 doi
035 $a 978-3-662-47967-4
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Badouel, Eric. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1069276
245 1 0 $a Petri Net Synthesis $h [electronic resource] / $c by Eric Badouel, Luca Bernardinello, Philippe Darondeau.
250 $a 1st ed. 2015.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2015.
300 $a XIII, 339 p. 140 illus., 1 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Texts in Theoretical Computer Science. An EATCS Series, $x 1862-4499
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.
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 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.
650 0 $a Computers. $3 565115
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Software engineering. $3 562952
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 669780
650 2 4 $a Mathematical Logic and Foundations. $3 669393
700 1 $a Bernardinello, Luca. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1069277
700 1 $a Darondeau, Philippe. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 675178
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662479667
776 0 8 $i Printed edition: $z 9783662479681
776 0 8 $i Printed edition: $z 9783662516218
830 0 $a Texts in Theoretical Computer Science. An EATCS Series, $x 1862-4499 $3 1254113
856 4 0 $u https://doi.org/10.1007/978-3-662-47967-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)