東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Petri net primer = a compendium on the core model, analysis, and synthesis /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Petri net primer/ by Eike Best, Raymond Devillers.
Reminder of title:	a compendium on the core model, analysis, and synthesis /
Author:	Best, Eike.
other author:	Devillers, Raymond.
Published:	Cham :Springer Nature Switzerland : : 2024.,
Description:	xiii, 545 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	Preface -- 1 First Steps in Petri Nets -- 2 Languages of Petri Nets -- 3 Reachability and Coverability -- 4 Linear-algebraic Structure of Petri Nets -- 5 Graph-theoretical Structure of Petri Nets -- 6 More Structure Theory -- 7 Program Verification Using Traps -- 8 Fairness, Simulations, and Inhibitor Arcs -- 9 Unfoldings and Reachability Checking -- 10 Petri Net Computers -- 11 Synthesis of Petri Nets from Labelled Transition Systems -- 12 Persistent Transition Systems and Choice-free Petri Nets -- 13 Divide-and-Conquer Methods for Synthesis -- 14 Marked Graph Synthesis -- 15 Bounded Choice-free Net Synthesis -- 16 Model Checking Safe, Strongly Persistent Petri Nets -- 17 Semilinearity -- 18 Decidability of the reachability problem -- 19 The Box Algebra 1/2: Refinement and Recursion -- 20 The Box Algebra 2/2: Iteration and Data -- 21 High-level Petri Nets -- Biblyography -- Index.
Contained By:	Springer Nature eBook
Subject:	Petri nets. -
Online resource:	https://doi.org/10.1007/978-3-031-48278-6
ISBN:	9783031482786

Petri net primer = a compendium on the core model, analysis, and synthesis /
Best, Eike.

Petri net primera compendium on the core model, analysis, and synthesis /[electronic resource] :by Eike Best, Raymond Devillers. - Cham :Springer Nature Switzerland :2024. - xiii, 545 p. :ill. (some col.), digital ;24 cm. - Computer science foundations and applied logic,2731-5762. - Computer science foundations and applied logic..

Preface -- 1 First Steps in Petri Nets -- 2 Languages of Petri Nets -- 3 Reachability and Coverability -- 4 Linear-algebraic Structure of Petri Nets -- 5 Graph-theoretical Structure of Petri Nets -- 6 More Structure Theory -- 7 Program Verification Using Traps -- 8 Fairness, Simulations, and Inhibitor Arcs -- 9 Unfoldings and Reachability Checking -- 10 Petri Net Computers -- 11 Synthesis of Petri Nets from Labelled Transition Systems -- 12 Persistent Transition Systems and Choice-free Petri Nets -- 13 Divide-and-Conquer Methods for Synthesis -- 14 Marked Graph Synthesis -- 15 Bounded Choice-free Net Synthesis -- 16 Model Checking Safe, Strongly Persistent Petri Nets -- 17 Semilinearity -- 18 Decidability of the reachability problem -- 19 The Box Algebra 1/2: Refinement and Recursion -- 20 The Box Algebra 2/2: Iteration and Data -- 21 High-level Petri Nets -- Biblyography -- Index.

ISBN: 9783031482786

Standard No.: 10.1007/978-3-031-48278-6doiSubjects--Topical Terms:

654110
Petri nets.

LC Class. No.: QA267

Dewey Class. No.: 511.35

Petri net primer = a compendium on the core model, analysis, and synthesis /
LDR:02015nmm a2200349 a 4500 001 2368560
003 DE-He213
005 20240123084230.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031482786 $q (electronic bk.)
020 $a 9783031482779 $q (paper)
024 7 $a 10.1007/978-3-031-48278-6 $2 doi
035 $a 978-3-031-48278-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UYAM $2 bicssc
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
072 7 $a PBD $2 thema
082 0 4 $a 511.35 $2 23
090 $a QA267 $b .B561 2024
100 1 $a Best, Eike. $3 1003389
245 1 0 $a Petri net primer $h [electronic resource] : $b a compendium on the core model, analysis, and synthesis / $c by Eike Best, Raymond Devillers.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Birkhäuser, $c 2024.
300 $a xiii, 545 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Computer science foundations and applied logic, $x 2731-5762
505 0 $a Preface -- 1 First Steps in Petri Nets -- 2 Languages of Petri Nets -- 3 Reachability and Coverability -- 4 Linear-algebraic Structure of Petri Nets -- 5 Graph-theoretical Structure of Petri Nets -- 6 More Structure Theory -- 7 Program Verification Using Traps -- 8 Fairness, Simulations, and Inhibitor Arcs -- 9 Unfoldings and Reachability Checking -- 10 Petri Net Computers -- 11 Synthesis of Petri Nets from Labelled Transition Systems -- 12 Persistent Transition Systems and Choice-free Petri Nets -- 13 Divide-and-Conquer Methods for Synthesis -- 14 Marked Graph Synthesis -- 15 Bounded Choice-free Net Synthesis -- 16 Model Checking Safe, Strongly Persistent Petri Nets -- 17 Semilinearity -- 18 Decidability of the reachability problem -- 19 The Box Algebra 1/2: Refinement and Recursion -- 20 The Box Algebra 2/2: Iteration and Data -- 21 High-level Petri Nets -- Biblyography -- Index.
650 0 $a Petri nets. $3 654110
650 1 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Dynamical Systems. $3 3538746
650 2 4 $a Mathematical Modeling and Industrial Mathematics. $3 891089
650 2 4 $a Stochastic Modelling. $3 3538808
700 1 $a Devillers, Raymond. $3 2156412
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Computer science foundations and applied logic. $3 3625395
856 4 0 $u https://doi.org/10.1007/978-3-031-48278-6
950 $a Computer Science (SpringerNature-11645)