國立高雄大學圖資館 |

Language: English

Back

Petri net synthesis

Badouel, Eric.

Petri net synthesis

Record Type:	Electronic resources : Monograph/item
Title/Author:	Petri net synthesisby Eric Badouel, Luca Bernardinello, Philippe Darondeau.
Author:	Badouel, Eric.
other author:	Bernardinello, Luca.
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg :2015.
Description:	xiii, 339 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Petri nets.
Online resource:	http://dx.doi.org/10.1007/978-3-662-47967-4
ISBN:	9783662479674$q(electronic bk.)

Petri net synthesis
Badouel, Eric.

Petri net synthesis[electronic resource] /by Eric Badouel, Luca Bernardinello, Philippe Darondeau. - Berlin, Heidelberg :Springer Berlin Heidelberg :2015. - xiii, 339 p. :ill., digital ;24 cm. - 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$q(electronic bk.)

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

278494
Petri nets.

LC Class. No.: QA267

Dewey Class. No.: 511.35

Petri net synthesis
LDR:03077nmm a2200349 a 4500 001 476572
003 DE-He213
005 20160428142344.0
006 m d
007 cr nn 008maaau
008 160526s2015 gw s 0 eng d
020 $a 9783662479674$q(electronic bk.)
020 $a 9783662479667$q(paper)
024 7 $a 10.1007/978-3-662-47967-4 $2 doi
035 $a 978-3-662-47967-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 511.35 $2 23
090 $a QA267 $b .B137 2015
100 1 $a Badouel, Eric. $3 731252
245 1 0 $a Petri net synthesis $h [electronic resource] / $c by Eric Badouel, Luca Bernardinello, Philippe Darondeau.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2015.
300 $a xiii, 339 p. : $b ill., digital ; $c 24 cm.
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 Petri nets. $3 278494
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Theory of Computation. $3 274475
650 2 4 $a Mathematics of Computing. $3 273710
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 273711
650 2 4 $a Mathematical Logic and Foundations. $3 274479
700 1 $a Bernardinello, Luca. $3 731253
700 1 $a Darondeau, Philippe. $3 284797
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Texts in theoretical computer science. $p An EATCS series. $3 731254
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-47967-4
950 $a Computer Science (Springer-11645)