README 1.2 KB

1234567891011121314151617181920212223242526272829303132333435363738394041
  1. Version: TINA toolbox 3.1.0
  2. Visualizer:
  3. ~/tina-3.1.0/bin/nd tocheck.net
  4. Reachability Graph:
  5. ~/tina-3.1.0/bin/tina -C tocheck.ndr tocheck.ktz
  6. Checking properties:
  7. ~/tina-3.1.0/bin/selt tockeck.ktz tocheck.ltl >> tocheck.selt
  8. properties:
  9. op finished = T /\ A_finished /\ B_finished /\ C_finished /\ D_finished;
  10. [] (finished => dead);
  11. [] (dead => finished);
  12. [] <> dead ;
  13. - <> finished;
  14. The first line corresponds to the formula. The operator finished is defined as
  15. "true and A_finished and B_finished and C_finished and D_finished".
  16. The four others lines correspond to four properties to check:
  17. [] (finished => dead);
  18. can be translated by "always (finished implies deadlock)" which means that in
  19. any cases, the finished state implies the deadlock property.
  20. [] (dead => finished);
  21. can be translated by "always (deadlock implies finished)", which means that
  22. in any cases, the deadlock property implies the finished state.
  23. [] <> dead ;
  24. can be translated by "always eventually deadlock", which means that a
  25. deadlock can be happen.
  26. - <> finished;
  27. can be translated by "non eventually finished", which means that it never
  28. reach finished.