000 04165nam a22005055i 4500
003 DE-He213
005 20231104114434.0
007 cr nn 008mamaa
008 151102s2015 gw | s |||| 0|eng d
020 _a9783662479674
_z978-3-662-47967-4
024 7 _a10.1007/978-3-662-47967-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUY
_2thema
072 7 _aUYA
_2thema004.0151
_223
100 1 _aBadouel, Eric.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aPetri Net Synthesis /
_cby Eric Badouel, Luca Bernardinello, Philippe Darondeau.
250 _a1st ed. 2015.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2015.
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 0 _aTexts in Theoretical Computer Science. An EATCS Series,
_x1862-4499
505 0 _aIntroduction -- 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 _aThis 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 _aInformation theory.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic, Symbolic and mathematical.
650 1 4 _aTheory of Computation.
_0http://scigraph.springernature.com/things/product-market-codes/I16005
650 2 4 _aMathematics of Computing.
_0http://scigraph.springernature.com/things/product-market-codes/I17001
650 2 4 _aSoftware Engineering/Programming and Operating Systems.
_0http://scigraph.springernature.com/things/product-market-codes/I14002
650 2 4 _aMathematical Logic and Foundations.
_0http://scigraph.springernature.com/things/product-market-codes/M24005
700 1 _aBernardinello, Luca.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
700 1 _aDarondeau, Philippe.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
710 2 _aSpringerLink (Online service)
856 4 0 _uhttps://doi.org/10.1007/978-3-662-47967-4
_3Springer eBooks
_zOnline access link to the resource
912 _aZDB-2-SCS
999 _c200434559
_d52771
942 _2lcc
_cEBK
041 _aeng