This page lists all models in the benchmark set. Models are divided into several classes according to their type. For each model we give the size of the model in hundreds of characters of model description (this should give just a high-level orientation about the complexity of individual models).
Actual number of models in the benchmark set: 57 Actual number of model instances in the benchmark set: 300
| Name | Description | Size |
|---|---|---|
| brp | Bounded retransmission protocol | 38 |
| brp2 | Bounded retransmission protocol (with timing) | 72 |
| cambridge | Cambridge ring protocol | 46 |
| collision | Collision avoidance protocol | 20 |
| firewire_link | Layer link protocol of the IEEE-1394 | 117 |
| iprotocol | Optimized sliding window protocol | 44 |
| pgm_protocol | Pragmatic General Multicast (PGM) protocol | 83 |
| protocols | Simple communication protocols | 36 |
| rether | Real-time Ethernet protocol | 24 |
| Name | Description | Size |
|---|---|---|
| anderson | Andersons queue lock mutual exclusion algorithm | 5 |
| at | Alur-Taubenfeld mutual exclusion algorithm | 12 |
| bakery | Bakery mutual exclusion algorithm | 8 |
| driving_phils | Mutual exclusion of processes accessing several resources | 50 |
| fischer | Fisher's mutual exclusion algorithm | 8 |
| lamport | Lamport's fast mutual exclusion algorithm | 7 |
| lamport_nonatomic | Lamport mutual exclusion protocol with nonatomic operations | 13 |
| lann | Lann leader election algorithm for token ring | 15 |
| mcs | MCS queue lock mutual exclusion algorithm | 8 |
| peterson | Peterson's mutual exclusion protocol for N processes | 6 |
| phils | Dining philosophers problem | 10 |
| szymanski | Szymanski mutual exclusion protocol | 14 |
| Name | Description | Size |
|---|---|---|
| extinction | Leader election algorithm for arbitrary networks | 30 |
| firewire_tree | Firewire (IEEE 1394) tree identification protocol | 43 |
| leader_election | Leader election algorithm on unidirectional ring | 18 |
| leader_filters | Leader election algorithm based on filters | 7 |
| Name | Description | Size |
|---|---|---|
| cyclic_scheduler | Milner's cyclic scheduler | 10 |
| msmie | Multiprocessor Shared-Memory Information Exchange protocol | 29 |
| needham | Needham-Schroeder public key authentication protocol | 44 |
| public_subscribe | Publish/subscribe notification protocol | 82 |
| reader_writer | Readers-writers problem | 11 |
| synapse | Synapse cache coherence protocol | 50 |
| telephony | Telecommunication service | 37 |
| Name | Description | Size |
|---|---|---|
| bopdp | Audio/Video Power Controller | 81 |
| elevator | Elevator controller | 21 |
| elevator2 | Another elevator controller | 10 |
| gear | Gear Controller | 57 |
| lifts | Distributed system for lifting trucks | 64 |
| plc | PLC control schedule | 272 |
| production_cell | Production cell case study | 30 |
| sorter | Lego brick sorter | 84 |
| train-gate | Simple controller of a train gate | 23 |
| Name | Description | Size |
|---|---|---|
| blocks | Blocks world | 17 |
| elevator_planning | Planning of elevator strategy under several constraints | 16 |
| exit | Model of a city team game | 36 |
| krebs | Krebs cycle | 18 |
| schedule_world | Scheduling of machines for production | 41 |
| Name | Description | Size |
|---|---|---|
| adding | Concurrent adding puzzle | 3 |
| bridge | Puzzle about men crossing a bridge | 12 |
| frogs | 2D Toads and Frogs puzzle | 20 |
| hanoi | Tower of Hanoi puzzle | 11 |
| loyd | Sam Lloyd's fifteen puzzle | 8 |
| peg_solitaire | Peg solitaire | 26 |
| pouring | Water pouring puzzle | 11 |
| rushhour | A sliding block puzzle | 25 |
| sokoban | Sokoban sliding block puzzle | 25 |
| Name | Description | Size |
|---|---|---|
| lup | Sharing SRAM and CAM by lookup processors | 10 |
| resistance | Model of a system for testing the quality of the cables | 34 |