SUMo'2011
International Workshop on
Scalable and Usable Model Checking for
Petri Nets and other models of Concurrency

Description of the «SharedMemory» model

This model is an example extracted from here. It models a system composed of P processors, each one with a local memory. Each processor can access its local memory using a dedicated local bus and the other memories using a unique shared bus. The processor accessing a remote memory have priority on those accessing their own memory. It is assumed that external access request causes preemption of the owner processor eventually accessing its local memory.


The figure above shows this model and is set up for 10 processors.

Scale factor

The scale factor is the number processors (size of color domain P). Proposed instances of this models contain the following numbers: 5, 10, 20, 50, 100, 200, 500, 1000, 2000, 5000, 10000, 20000, 50000.

Model files

PNML files and a set of properties respecting the BNF we propose are available in the submission kit.


 
A satellite event of PETRI NETS'2011 and ACSD'2011
June  21, 2011

Model Checking Contest, «SharedMemory» model

PeoplePeople.html
PetersonPeterson_model.html
PhilosopherPhilosophers_model.html
SharedMemory
FMSFMS_model.html
KanbanKanban_model.html
MAPKMAPK_model.html
FAQFAQ.html
BNF FormulaeBNF_for_formulae.html

Models

RulesRules.html
TokenRingTokenRing_model.html
Submission Kithttp://sumo.lip6.fr/SUMo-2011-MCC-BASE.tgz