Vai al contenuto principale della pagina

Petri Net Synthesis / / by Eric Badouel, Luca Bernardinello, Philippe Darondeau



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Badouel Eric Visualizza persona
Titolo: Petri Net Synthesis / / by Eric Badouel, Luca Bernardinello, Philippe Darondeau Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Edizione: 1st ed. 2015.
Descrizione fisica: 1 online resource (XIII, 339 p. 140 illus., 1 illus. in color.)
Disciplina: 511.3
Soggetto topico: Computers
Computer science—Mathematics
Software engineering
Mathematical logic
Theory of Computation
Mathematics of Computing
Software Engineering/Programming and Operating Systems
Mathematical Logic and Foundations
Persona (resp. second.): BernardinelloLuca
DarondeauPhilippe
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di bibliografia: Includes bibliographical references.
Nota di contenuto: 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.
Sommario/riassunto: 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.
Titolo autorizzato: Petri Net Synthesis  Visualizza cluster
ISBN: 3-662-47967-2
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910299259803321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Texts in Theoretical Computer Science. An EATCS Series, . 1862-4499