|
|
 |
| Àâòîðèçàöèÿ |
|
|
|
| Ïîèñê ïî óêàçàòåëÿì |
|
|
|
|
|
|
|
 |
|
|
|
| Peterson J.L. — Petri net theory and the modeling of systems |
|
|
|
| Ïðåäìåòíûé óêàçàòåëü |
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
|
|
|
| Ðåêëàìà |
|
|
|
|
|
Î ïðîåêòå