| By: |
THEN RepeatFor 7 (ParallelOp -1) THEN ExRepD THEN Analyze 0 THEN Try Trivial |
| 1 |
7. @action a:T 7. @precondition a(v) is 7. @ 7. 8. 8. @i: (with ds: x : A 8. @action a:T 8. @precondition a(v) is 8. @ 8. 8. D 8. realizes es.( 8. realizes es.& ( 8. realizes es.& (loc(e) = i 8. realizes es.& ( 8. realizes es.& (kind(e) = locl(a) 8. realizes es.& ( 8. realizes es.& (loc(e) = i 8. realizes es.& ( 8. realizes es.& ((kind(e) = locl(a) 8. realizes es.& (& ( 8. realizes es.& (& ((e <loc e') 8. realizes es.& (& (& kind(e') = locl(a) 9. @i: (with ds: x : A 9. @action a:T 9. @precondition a(v) is 9. @ 9. 10. D : Dsys 11. @i: (with ds: x : A 11. @action a:T 11. @precondition a(v) is 11. @ 12. 12. D 12. 12. ( 12. (PossibleWorld(D';w) 12. ( 12. (( 12. (& ( 12. (& ( 12. (& (loc(e) = i 12. (& ( 12. (& ((kind(e) = locl(a) 12. (& (& ( 12. (& (& ((e <loc e') 12. (& (& (& kind(e') = locl(a) 13. D' : Dsys 14. D 15. 15. PossibleWorld(D';w) 15. 15. ( 15. & ( 15. & ( 15. & (loc(e) = i 15. & ( 15. & ((kind(e) = locl(a) 15. & (& ( 15. & (& ((e <loc e') 15. & (& (& kind(e') = locl(a) 16. w : World 17. 17. PossibleWorld(D';w) 17. 17. ( 17. & ( 17. & ( 17. & (loc(e) = i 17. & ( 17. & ((kind(e) = locl(a) 17. & (& ( 17. & (& ((e <loc e') 17. & (& (& kind(e') = locl(a) 18. p : FairFifo 19. PossibleWorld(D';w) 20. 21. 22. 22. loc(e) = i 22. 22. (kind(e) = locl(a) 22. & ( 22. & ((e <loc e') | 3 steps |
About: