Lecture Notes in Computer Science 3472

656 Index
MUST preorder, 184
mutation testing, 333
natural language, 442, 445, 446
necessary condition, 332
non-probabilistic process, 235
NTIF, see specification language
objectgeode, 429
observable testing preorder, see preorder
observation, 577
– pack, 577
– reduced observation table, 586
– table, 582
observation preorder, see preorder
OMEGA, see tool
operating system, 444
– POSIX, 444, 446
– UNIX, 444
oracle, 576
out, 175
parallel composition, 245, 246, 248, 258
partition graph, 373
partition tour, 408
partitioning heuristic, 332
path
– finite, 235, 238
– infinite, 238
path condition, 338, 340
PDS, 41
performance constraints, 360
PHACT, 409
PIXIT, 409
POSIX, 444
postcondition, 342
precondition, 342
preorder, 117
– complete trace, 128
– failure trace, 142
– fair testing, 143
– observable testing, 127
– observation, 129
– refusal, 138, 139
– should testing, 144
– testing, 133
– trace, 128
preset distinguishing sequences, 41
preset experiment, 614
preset homing sequence, 8
probabilistic bisimulation, 271
probabilistic process, 240
– fully, 237
probability space, 236
process algebra
– ACSR, 360, 364
– action, 362
– behavioral constraints, 364
– event, 362
– performance constraints, 364
– TCSP, 360
process of MBT
– abstract, 439
processor, 442
– ARM-2, 443
– intel 8085, 443
– microprocessor, 443
– multiprocessor, 443, 445
– PowerPC, 443, 446, 451
program correctness, 342
prolog, 344
PROMELA, 446
promela, see specification language
proof procedure, 338
proof tactic, 328
protocol, 443
– cache coherency, 443, 445
– conference protocol, 443
– engineering, 445
query
– equivalence, 576
– membership, 576
quiescent preorder, 181
quiescent state, 174
random sequence, 409
real-time
– hard, 355
– soft, 355
real-time system, 355
recurrent automaton, see synchronizing
sequence
recurrent word, see synchronizing
sequence
refusal, 124
refusal preorder, see preorder
regular, 559
regularity hypothesis, 336