P

Package Router problem 295

parallel 38

parallel composition 39–41, 44, 51, 59

parameters 380

parcel router problem 295–306

applet display 301, 302

implementation 301–306

modeling 296–301

ParcelMover interface 302

Parrow, J. 207

Pascal Plus 104

passive entities 76, 81

passive objects 114

Peterson’s algorithm 158

Peterson, J.L. 60

Petri Nets 60, 180

π-calculus 207

pipe 273

Pipe class 245, 248

PipeImplBuf class 248

PipeImplUnBuf class 248

pipeline 237

pipes 238, 239

Player class 186

Port class 220, 226, 228, 232

ports 219, 221, 223, 224

pre-tick() 288, 292, 293, 295

pre-tick clock phase 290, 315

pre-tick phase 292, 316

preemption 107–109, 120

prefix labels 45, 51

prefix matching 382

Primes Sieve

applet 244, 245

implementation 244–249

model 238–244

process architecture 238

Primes Sieve of Eratosthenes 238

PrimesCanvas class 244, 246

printer–scanner system 109–111

process 2, 5, 11–30, 367, 390–391

alphabets 22–23

definition 375–378

interaction 42, 59

labeling 45–47, 59

parameters 20

Producer class 289–292

producer process 94

producer-consumer model 289–292

ProducerConsumer class 289

Program Verification 319–340

progress 135

analysis 137–139

properties 135–138, 140, 149–150, 156, 191, 193, 369, 382

cruise control system 172–174

violation 138, 139, 154

property 123, 125, 127, 153, 154, 369