Baeten J.C.M., Middelburg С.A. — Process Algebra with timing :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Baeten J.C.M., Middelburg С.A. — Process Algebra with timing

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

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

Название: Process Algebra with timing

Авторы: Baeten J.C.M., Middelburg С.A.

Аннотация:

This book is concerned with a number of theories that can be used for describing and analyzing systems of interacting components in case it is desirable or necessary to regard their time-dependent behavior.
Society is becoming increasingly more dependent on complex computer-based systems that are composed of several components that act concurrently and interact - to synchronize and communicate with each other. The complexity of these systems arises to a great extent from the many ways in which their components can interact. The need that these components act and interact on time as well adds considerably to the complexity.

Язык:

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2002

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

Добавлена в каталог: 16.06.2011

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

      22
      27
$ACP^{dat}$       91
$ACP^{dat}+Rec$       96
$ACP^{dat}\checkmark C$       114
$ACP^{dat}\checkmark$       108
$ACP^{dat}\tau$       219
$ACP^{drt}$       58
$ACP^{drt}+Rec$       63
$ACP^{drt}_\tau$       212
$ACP^{sat}$       179
$ACP^{sat}+Rec$       184
$ACP^{sat}I$       184
$ACP^{sat}I\checkmark C$       197
$ACP^{sat}I\checkmark$       193
$ACP^{sat}_\tau$       227
$ACP^{srt}$       144
$ACP^{srt}+Rec$       149
$ACP^{srt}I$       149
$ACP^{srt}_\tau$       224
      13
$BPA^{dat}$       77
$BPA^{dat}+Rec$       83
$BPA^{dat}_\tau$       218
$BPA^{drt}$       49
$BPA^{drt}+Rec$       53
$BPA^{drt}-ID$       39
$BPA^{drt}_-$       46
$BPA^{drt}_-+Rec$       49
$BPA^{drt}_--ID+Rec$       43
$BPA^{drt}_\tau$       209
$BPA^{sat}$       165
$BPA^{sat}+Rec$       170
$BPA^{sat}I$       173
$BPA^{sat}_\tau$       226
$BPA^{srt}$       130
$BPA^{srt}+Rec$       135
$BPA^{srt}I$       137
$BPA^{srt}_\tau$       221
      9
Absolute timing      71
Absolutely timed process      120
Abstraction      208 212 219 224 227
action      2 10
Action step predicate      12 41 82 133 168
Action termination predicate      12 41 82 133 168
Action, delayable      43 84 137 172
Action, undelayable      32 39 72 77 125 130 160 165
Algebra      254
Algebra of closed terms      256
Algebra of terms      255
Algebraic theory      VI
Alternative composition      2 10 39 77 130 165
Argument sort      252 256
ASSIGNMENT      254
At-time-point      196 198
At-time-point-greater-than      196 198
Axiomatic conservativity theorem      267
Axioms of discrete absolute initialization      111
Axioms of discrete relative initialization      52
Axioms of standard absolute initialization      195
Axioms of standard concurrency      26
Axioms of standard relative initialization      134
Base sort      263
Basic term      11 40 47 51 80 132 139 168 174 241
Binding signature      263
Binding sort      263
Binding term      263
Binding term, closed      264
Bisimilarity      see "Bisimulation equivalence"
Bisimulation      260
Bisimulation equivalence      5 34 75 126 162 260
Bisimulation equivalence, branching tail      207 211 223
Bisimulation equivalence, branching tail, rooted      207 211 223
Bisimulation model      260
Bisimulation, branching      206
Bisimulation, branching tail      206 210 222
Bottle filling system      153
Bound variable      264
Box-sorter unit      143
BPA      9
Buffer      27 63 96 214
Burglar alarm      164
CABP      88
Carrier      254
clock      76
Communication function      22
Communication merge      23 58 92 144 179
Complete axiomatization      255
Complete axiomatization theorem      267
Complete TSS      262
Completeness theorem      249 250
Conditional      112 114 197 198
conditions      114 198
Congruence      256
Congruence theorem      260
Connection diagram      21
Conservative extension, axiomatic      266
Conservative extension, operational      266
Constant      252
Continuous time scale      123
Dataflow network      16 45
Deadlock      5 10
Deadlock, undelayable      34 39 74 77 126 130 162 165
Deadlocked predicate      48 82 133 168
Deadlocked process      36 46 74 77 126 130 162 165
Delay, absolute      72 78 160 165
Delay, relative      33 39 125 130
Delay, relative, generalized      156
Derivable equation      253
Discrete time scale      31
Discretely initialized process      204
Discretization      203
Discretized process      203
Domain of transition predicates      257
Elimination Theorem      242 243
Embedding      268
Encapsulation      19 23 58 92 144 179
equation      253
Equation, closed      253
Equational logic      251
Equational specification      253
Expansion theorem      27 63 96 148 184
Explicit definition      268
External port      23
Firmly free occurrence      266
Firmly fresh term      266

Fischer’s protocol      97 220
Free variable      264
Gas burner controller      151
Gas monitor      176
Generalization      268
Given sort      268
Grs      see "Guarded recursive specification"
Guarded recursive specification      6 13 43 83 135 171
Handshaking axiom      26 63 96 148 184
Handshaking communication      23
In-time-slice      112 114
In-time-slice-greater-than      112 114
Inert      206
Initial abstraction, discrete, of conditions      114
Initial abstraction, discrete, of processes      106 108
Initial abstraction, standard, of conditions      198
Initial abstraction, standard, of processes      192 193
Initialization, absolute, of conditions      113 114 198
Initialization, absolute, of processes      77 78 165
Initialization, relative      38 50 130
Integration      128 137 164 173
Intended model      259
Internal port      23
Interpretation      254 258
interval      273
Left merge      23 58 92 144 179
Lighting controller      128
Linear recursion      16 44 85 136 172
Maximal progress operator      235
Message-passing system      21 234 237 239
Model      254 259
Motor control system      186
Negative transition formula      262
Non-negative real numbers      270
Non-negative real numbers, sets of      273
Operational conservativity theorem      267
Operator      252
Panth format      262
Panth format, generalized      265
Panth format, generalized, relaxed      269
PAR protocol      56 64 216
Parallel composition      19 23 58 91 144 179
Parametric timing      105 192
Path format      260
Polling process      141
Port      23
Positive transition formula      257
Positive transition rule      257
Predicate      256
Process      VI
Process algebra      VII
Process algebra with discrete absolute timing      71
Process algebra with discrete relative timing      32
Process algebra with standard absolute timing      159
Process algebra with standard relative timing      124
Process algebra without timing      1
Process creation operator      238
Processes      10
Processes with absolute timing      77 165
Processes with relative timing      39 130
QUEUE      129
Quotient algebra      256
Railroad crossing controller      85 103 187 228
Reactor core control      178
Recursive specification      13
Recursive specification, solution of      13
Relative timing      31
Relatively timed process      119
Representation lemma      242 243
Result sort      252
Robot control system      190
Root condition      207 211 223
Sequential composition      2 10 39 78 130 165
Signature      252
Silent step      205 208
Silent step, undelayable      209 218 221 226
sort      252
Sos      251
Sound axiomatization      255
Soundness Theorem      244 247
Source-dependency      266 267
State operator      232
Stratifiable TSS      262
Structural operational semantics      see "SOS"
Subalgebra      255
Substitution      252
Substitution, closed      252
Supported model      259
Telephone answering machine      30 67
Term      252
Term evaluation      254 264
Term, closed      252
Theory of SOS      251
Time additivity      41
Time determinism      41
Time factorization      33
Time free process      69
Time free projection      69
Time interpolation      41
Time slice      31
Time spectrum expansion      116 198
Time spectrum tail      119
Time step predicate      41 82 133 168
Time-out, absolute      76 78 164 165
Time-out, relative      38 50 129 130
Time-out, undelayable, absolute      179 226
Time-out, undelayable, relative      144 221
Time-stamped action      120
Timer      36 53
Transition      259
Transition formula      257
Transition formula, closed      257
Transition predicate      257
Transition rule      257
Transition rule, closed      257
Transition rule, conclusion of      257
Transition rule, premise of      257
Transition rule, substitution instance of      257
Transition rule, substitution instance of, closed      257
Transition system      258
Transition system specification      see "TSS"
TSS      257
Undelayable alphabet operator      235
Variable      252
Variable domain      252
Variable-binding operator      263
Well-supported model      262

О проекте