Calcul des etats atteignables de programmes Esterel partitionne ...
Calcul des etats atteignables de programmes Esterel partitionne ...
Calcul des etats atteignables de programmes Esterel partitionne ...
- No tags were found...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
66 CHAPITRE 5. CALCUL DES ETATS ATTEIGNABLES PARTITIONNÉ1 reachable ← ι2 pending ← ι3 (I , O , N , E , F) ← G(T)4 R ← Register〈N〉5 inner ← Closure (N,E) (I)6 R + ← Register〈inner〉7 area ← NOr(R R + )8 tantque ( pending ≠ ∅ ) faire9 surface ← Surface (N,E∪F) (inner)10 frontier ← Sort ≺ (Trans (N,F) (surface))11 i ← 112 pending ′ ← pending13 tantque ( (pending ∩ area) = ∅ ) faire14 f ← frontier[i]15 inner new ← Closure (N,E) (Dest(f))16 R new ← Register〈inner new 〉 R +17 si ( R new = ∅ ) alors18 E ← E ∪ {f}19 F ← F {f}20 inner ← inner ∪ inner new21 sinon si ( pending ′ ∩ Or(R new ) ≠ ∅ ) alors22 pending ′ ← pending ′ ∩ Or(R new )23 E ← E ∪ {f}24 F ← F {f}25 inner ← inner ∪ inner new26 R + ← R + ∪ R new27 area ← NOr(R R + )28 fin si29 i ← i + 130 fin tantque31 domain ← pending ∩ area32 new ← Image ∆ (Υ, domain) reachable33 pending ← (pending area) ∪ new34 reachable ← reachable ∪ new35 fin tantqueFig. 5.1 – Algorithme partitionné complet