• DocumentCode
    3436298
  • Title

    Liveness rules from fairness based on TLA

  • Author

    Wan Liang

  • Author_Institution
    Inst. of Comput. Software & Theor., Guizhou Univ., Guiyang, China
  • fYear
    2011
  • fDate
    3-5 Aug. 2011
  • Firstpage
    1186
  • Lastpage
    1188
  • Abstract
    Formal methods use mathematic and logic method to describe and validate the system, TLA (The temporal logic of actions) is for specifying systems, it is brought forward by Leslie Lamport, and it can specify a system´s modeling and property together. Its specifying language is TLA+ and the checking tool is TLC. Liveness property is important property of a system, it is close relation to fairness property. It is in formal a conjunct of the fairness properties of the system properties. Leslie Lamport has put forward several liveness rules. We use a new way to prove the liveness rule from weak fairness and the liveness rule from strong fairness.
  • Keywords
    formal specification; formal verification; temporal logic; TLA+; checking tool; fairness property; formal methods; liveness property; liveness rules; logic method; mathematic method; strong fairness; system modeling; system property; temporal logic of actions; weak fairness; Computer science; Mathematical model; Modeling; Safety; Semantics; Systematics; Fairness; Livness rules; TLA;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science & Education (ICCSE), 2011 6th International Conference on
  • Conference_Location
    Singapore
  • Print_ISBN
    978-1-4244-9717-1
  • Type

    conf

  • DOI
    10.1109/ICCSE.2011.6028844
  • Filename
    6028844