04944nam 22007695 450 991029925980332120200703132419.03-662-47967-210.1007/978-3-662-47967-4(CKB)3710000000521567(SSID)ssj0001584298(PQKBManifestationID)16264437(PQKBTitleCode)TC0001584298(PQKBWorkID)14866531(PQKB)10711453(DE-He213)978-3-662-47967-4(MiAaPQ)EBC6314957(MiAaPQ)EBC5596036(Au-PeEL)EBL5596036(OCoLC)932003038(PPN)258849282(PPN)190530685(EXLCZ)99371000000052156720151102d2015 u| 0engurnn|008mamaatxtccrPetri Net Synthesis /by Eric Badouel, Luca Bernardinello, Philippe Darondeau1st ed. 2015.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2015.1 online resource (XIII, 339 p. 140 illus., 1 illus. in color.) Texts in Theoretical Computer Science. An EATCS Series,1862-4499Bibliographic Level Mode of Issuance: Monograph3-662-47966-4 Includes bibliographical references.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.Texts in Theoretical Computer Science. An EATCS Series,1862-4499ComputersComputer science—MathematicsSoftware engineeringMathematical logicTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Mathematics of Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I17001Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Mathematical Logic and Foundationshttps://scigraph.springernature.com/ontologies/product-market-codes/M24005Computers.Computer science—Mathematics.Software engineering.Mathematical logic.Theory of Computation.Mathematics of Computing.Software Engineering/Programming and Operating Systems.Mathematical Logic and Foundations.511.3Badouel Ericauthttp://id.loc.gov/vocabulary/relators/aut1060883Bernardinello Lucaauthttp://id.loc.gov/vocabulary/relators/autDarondeau Philippeauthttp://id.loc.gov/vocabulary/relators/autMiAaPQMiAaPQMiAaPQBOOK9910299259803321Petri Net Synthesis2516041UNINA