√лавна€    Ex Libris     ниги    ∆урналы    —татьи    —ерии     аталог    Wanted    «агрузка    ’удЋит    —правка    ѕоиск по индексам    ѕоиск    ‘орум   
blank
јвторизаци€

       
blank
ѕоиск по указател€м

blank
blank
blank
 расота
blank
Peterson J.L. Ч Petri net theory and the modeling of systems
Peterson J.L. Ч Petri net theory and the modeling of systems

„итать книгу
бесплатно

—качать книгу с нашего сайта нельз€

ќбсудите книгу на научном форуме



Ќашли опечатку?
¬ыделите ее мышкой и нажмите Ctrl+Enter


Ќазвание: Petri net theory and the modeling of systems

јвтор: Peterson J.L.

јннотаци€:

Petri net theory has developed considerably from its beginnings with Dr. Petri's 1962 Ph.D. dissertation. However, much of the work on Petri nets is hard to obtain, being available only as reports and dissertations scattered among many sources. Despite the difficulty in learning about Petri nets, however, their use is constantly increasing. It is becoming expected that every computer scientist know some basic Petri net theory.


язык: en

–убрика: Computer science/

—татус предметного указател€: √отов указатель с номерами страниц

ed2k: ed2k stats

√од издани€: 1981

 оличество страниц: 294

ƒобавлена в каталог: 16.11.2009

ќперации: ѕоложить на полку | —копировать ссылку дл€ форума | —копировать ID
blank
ѕредметный указатель
Abstract families of languages      175Ч176
Agerwala, T      193Ч194 201 209 210 235 242Ч243
Alphabet      153
Alternative definitions      27Ч29
Analysis of Petri nets      79Ч114 152Ч153
AND logic      190 227
Applied Petri net theory      4Ч6
Asynchronous      35
Asynchronous pipeline      49
Azema, P.      244
Backward marking class      26
Baer, J      29 77 191 210 235 244
Bag theory      7 237Ч240
Baker, H.      245
bar      10
Basis vectors      232
BernsteinТs conditions      52Ч73 73 245
Berthelot, G.      246
Best, E.      246 274
Bibliography      241Ч278
Bipartite      11
Bounded buffer producer/consumer      64Ч65
Bounded context-free languages      181Ч183
Bounded nets      81Ч82 99Ч100 113 148
Bredt, T.      210 213 235 246Ч247
Bundle of arcs      14 16
Cardinality      8 238
CDC      6600 52Ч74 70Ч75
Change matrix      107
chemical systems      74
Cigarette smokersТ problem      192Ч193 216 269
circle      10
Classes of Languages      154
Closure properties      166Ч177
Colored tokens      30 209 258 278
Commoner, F.      6 112 206 209 248 256
Communication protocols      75 264Ч265
Complement      174
Completeness      192 242
complexity      115Ч150
components      2
Computation graphs      213Ч216 217Ч218
Computation Structures Group      6
Concatenation      167
Concurrency      3 35Ч40 59Ч60 169-171
conditions      31Ч34
Conference on concurrent systems      4 28 250
Conference on Petri nets      4
Conflict      40 59
Conflict-free Petri nets      209
Conservation      82Ч84 101Ч102 108 113
Constraints      190 196Ч198
Context-free languages      179Ч181 236
Context-sensitive languages      184Ч186 236
Cooprider, L.      77 248
Counters      181
Coverability      87Ч88 102Ч103
Crespi-Reghizzi, S. and Mandrioli, D.      113 174 186Ч187 249
Cross-product machine      45
Dead submarkings      131
Deadlock      66 85 104Ч105 207 211
Decidability      115Ч150
Decision power      189
Definitions of Petri net      6Ч30
Definitions of Petri net languages      154Ч158
Dennis, J.      4 6 250 270
Determinacy      52
Dijkstra, E.      61 65 192 216 251
Dining philosophers problem      65Ч66
Diophantine equations      133Ч134
Displacement vectors      232
Domain      239
Dual graph      13
Duplicate nodes      93Ч95 107
E-nets      77 268
Early development of Petri nets      3Ч4
Empty string      153
Enabled transitions      19
Enabling tokens      19
Equality problem      116 119 134 142Ч145
EQUIVALENCE      90 117Ч118 152 154 210Ч211
Events      31Ч34
Exclusive-or transition      190 198Ч199 235
Execution rules      16 18Ч20
Extended, input function      8
Extended, next-state function      25
Extended, output function      8
Extended, Petri net models      189Ч203
Final states      154 156
Finite state machines      41Ч46 204Ч205 212Ч213 217
Finite state systems      99
Finite substitution      177
Finiteness of reachability tree      98Ч99
Firing rules      18Ч20
Firing sequences      89Ч90 111
Firing vector      108 114 180
Floating point addition      49
Flowcharts      54Ч79
Fork/Join      59Ч60
Formal language theory      153Ч154
Forward marking class      26
Free-choice      59
Free-choice Petri nets      207Ч208 236
Free-labeling      155
Frontier nodes      92Ч97
G-type Petri net language      156
Games      26
General net theory      ix 4
Generalized L-type languages      160
Genrich, H      75 251Ч252
Grammar      154
Graph of a diophantine polynomial      134
Graphics display      30 249 268
Hack, M.      6 29 30 77 99 113 128 131 132 133 142 145 149 162 186 187 200 201 207 208 209 253Ч255
HALTING      20
HilbertТs Tenth Problem      133Ч136
Holt, A.      3 6 28 30 112 206 209 256 263
Homomorphism      177
Immediately reachable markings      24
Information System Theory Project      3 28 256
Inhibitor arcs      195Ч196 235
Initiation      37Ч38 229
Input function      6Ч9
Input places      6Ч7 10
Interactions with outside world      42Ч43
Interpretations      55Ч77 59
Intersection      171
Inverse G-type language      161
Inverse Petri net      15
Jantzen, M.      258
Jensen, K.      258
Job shop model      34
k-bounded      81Ч82
k-safe      81Ч82
Karp, R.      258
Karp, R. and Miller, R.      99 113 149 213 216 232 258Ч259
Keller, R      6 30 99 112 195 234 259Ч260
Kleene star      174Ч176
Kosaraju, S.      193Ч194 209 260
L-type Petri net language      156
Labeled Petri net      157
Labeling function      155
Laboratory for Computer Science      241
Lambda-free      155
Lambda-transitions      155
Language-preserving transformations      152
Languages      153 210Ч211
Lauer, P.      260Ч261
Lautenbach, K.      75 112 261
Legal systems      75
Levels of liveness      86Ч87
Lien, Y.      112 262
Limitations of reachability tree      103
Limited Petri net structures      124Ч128
Linear bounded automaton      184Ч185
Link processes      220
Lipton, R.      146Ч148 149 211 235 262
liveness      84Ч87 128Ч132
Loops in reachability tree      94 102
Machine shop model      33Ч34
Marked graphs      205Ч207 213 216
Marked Petri net      17
Marking class      26
Marking sequence      23
Matrix equations      107Ч112
Maximal ij-dead submarkings      131Ч132
Meldman, J.      30 75 263
Message transfer expression      221
Message transmission systems      220Ч226
Miller, R      210 236 265
Modeling      1Ч2 31Ч78
Modeling, computer hardware      40Ч75
Modeling, computer software      54Ч69
Modeling, convenience      203
Modeling, power      189 211
Multigraph      11
Multiple functional units      52Ч73
Multiplication subnet      136Ч138
Multiplicity      8 227
Murata, T.      112 113 206 209 266
Mutual exclusion problem      62Ч63 88
Next-state function      23 154
Noe, J.      30 77 190 249 267Ч268
Nondeterminism      36Ч37
Nonprimitive events      37Ч38
Nonreflexive Petri nets      124Ч128
Null string      153
Optimal code generation      70Ч75
Optimization of Petri nets      152
OR logic      227
Ordinary Petri nets      124Ч128
Output function      6Ч9
Output places      6Ч7 10
P-type Petri net language      157
P/V operations      192
P/V systems      68Ч69 209 216Ч219 224-226
Parallel composition      45
Parallelism      3 35Ч40 59Ч60
Parallelism, parbegin/parend      60Ч61
Parikh mapping      108 240
Parikh, R.      268
Path expressions      153
Patil, S.      28 190 192 196 209 216 269Ч270
Permissive nature of Petri nets      136
PERT charts      70Ч72 77
Peterson, J.      29 77 113 155 162 184 185 187 210 211 235 270
Petri nets, analysis      79Ч114 152Ч153
Petri nets, conferences on      4
Petri nets, definition      6Ч30
Petri nets, early development      3Ч4
Petri nets, free-choice      207Ч208 236
Petri nets, graphs      10Ч13
Petri nets, languages      151Ч188
Petri nets, markings      16Ч18
Petri nets, models      189Ч203
Petri nets, ordinary      124Ч127
Petri nets, self-loop-free      29 124Ч127
Petri nets, simple      208 236
Petri nets, standard form      162Ч165
Petri nets, structure      6Ч10
Petri nets, subclasses of      204Ч208
Petri nets, synthesis of      153
Petri, Carl Adam      ix x 3 6 28 270Ч271
Pipelined computers      46Ч71
Places      6Ч9
Polynomial graph inclusion problem      133Ч142
postconditions      32Ч34
Potentially fireable      85
preconditions      31Ч34
Prefix languages      157
Presburger arithmetic      150 272
Primitive events      37
Priorities      200Ч201 235
Priority producer/consumer problem      194Ч195
Producer/consumer problem      64Ч65 194Ч195
Production system      70 (see also Pipelined computers)
Program process modeling language      220Ч226
Project MAC      4 241
Proper termination      176
Properties of Petri net languages      162Ч187
Propositional calculus      75
Pure Petri net theory      5Ч6
QUEUE      214
Rabin, M      133 245
Rackoff, C.      148 272
Reachability, graph      113
Reachability, problem      87Ч89 108Ч112 119-124 125Ч128
Readers/writers problem      66Ч68 75
Reducibility      115 119
Register machines      201Ч203
Regular languages      154 178 236
Related models      210Ч236
Relativity theory      37
Repeated composition      174Ч177
Reservation table      53
Restricted Petri net models      124Ч127 189Ч190 204Ч208
Reversal      171Ч174
Reversible Petri nets      150
Riddle, W.      169 236 273
Run place      128 143 163
Sacerdote, S. and Tenney, R.      146 274
Safe markings      80
Safeness      80 99Ч100
Self-loop-free Petri nets      29 124Ч128
Self-loops      111
Sequence of actions      211
Sequence of events      36
Sequence of transitions      23 24 89Ч90 111 114 151
Set coverability problem      89
Set of initial markings      155
Set reachability problem      89
Set theory      237
Shapiro, R. and Saint, H.      54 70Ч75 77 275
Sifakis, J.      275Ч276
Simple Petri nets      208 236
Single-place zero-reachability problem      119Ч124
Single-transition liveness problem      128Ч132
Standard form Petri nets      162Ч165
Start place      155
Start state      154
Start vector      232
State      2
state machines      204Ч205
State space      23Ч25 211
Strictly conservative      82Ч83
String      153
Structural subclasses      204
Subbag      238
Subclasses of Petri nets      204Ч208
Submarking coverability problem      89
Submarking reachability problem      89 119Ч124
Subset reachability problem      90 116 119 134
Substitution      177
switches      191 199 235
Synchronization      3 61Ч62
Syntactic subclasses      204
Synthesis of Petri nets      153
System characterizations      151
System features      2Ч3
Szilard languages      186
1 2
blank
–еклама
blank
blank
HR
@Mail.ru
       © Ёлектронна€ библиотека попечительского совета мехмата ћ√”, 2004-2018
Ёлектронна€ библиотека мехмата ћ√” | Valid HTML 4.01! | Valid CSS! ќ проекте