COMP 522 Presented by Eugene Syriani Project
n = new Node(); n = new Node(); n = new Node(); n.add(graph); n.add(graph); n.add(graph); lbl = “n1”; lbl = “n1”; lbl = “n1”; n.label = lbl; n.label = lbl; n.label = lbl; n = new Node(); n = new Node(); n = new Node(); n.add(graph); n.add(graph); n.add(graph); lbl = “n1”; lbl = “n1”; lbl = “n1”; n.label = lbl; n.label = lbl; n.label = lbl;
isMoving=True blocked=False blocked=False blocked=True
T T=t isMoving=True id=processID → t → t C C
Priority 1 Priority 2
Priority 1 Priority 2
Priority 1 Priority 2
I am convinced that it is doable!
• Eugene Syriani, Modelling syntax and semantics of piDEMOS in AToM 3 , MSDL Summer Presentations, 2006 • Hans Vangheluwe, The Discrete EVent System specifcation (DEVS) formalism , Modelling and Simulation Lecture Notes, 2002 • G. Birtwistle and C. Tofts, Operational Semantics Of Process- Oriented Simulation Languages --Part 1: piDemos , 1993 • Modelling, Simulation and Design Lab of McGill, AToM 3 , Nov. 2 nd 2006 update
Recommend
More recommend