GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae

  • Yih-Kuen Tsay
  • Yu-Fang Chen
  • Ming-Hsien Tsai
  • Kang-Nien Wu
  • Wen-Chin Chan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4424)

Abstract

In this paper, we present a tool named GOAL (an acronym derived from “Graphical Tool for Omega-Automata and Logics”) whose main functions include (1) drawing and testing Büchi automata, (2) checking the language equivalence between two Büchi automata, (3) translating quantified propositional linear temporal logic (QPTL) formulae into equivalent Büchi automata, and (4) exporting Büchi automata as Promela code. The GOAL tool, available at http://goal.im.ntu.edu.tw, can be used for educational purposes, helping the user get a better understanding of how Büchi automata work and how they are related to linear temporal logics. It may also be used, as we shall explain below, to construct correct and smaller specification automata, supplementing model checkers that adopt the automata-theoretic approach, such as SPIN [5].

References

  1. 1.
    Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)Google Scholar
  2. 2.
    Etessami, K., Holzmann, G.: Optimizing Büchi automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 153–167. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  3. 3.
    Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)Google Scholar
  4. 4.
    Gerth, R., et al.: Simple on-the-fly automatic verification of linear temporal logic. In: Protocol Specification, Testing, and Verification, pp. 3–18. Chapman and Hall, Boca Raton (1995)Google Scholar
  5. 5.
    Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Reading (2003)Google Scholar
  6. 6.
    Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safty. Springer, Heidelberg (1995)Google Scholar
  7. 7.
    Rodger, S., Finley, T.: JFLAP, http://www.jflap.org/
  8. 8.
    Safra, S.: On the complexity of ω-automta. In: Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1988), pp. 319–327 (1988)Google Scholar
  9. 9.
    Sistla, A.P., Vardi, M., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science 49, 217–237 (1987)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Tsay, Y.-K., Chen, Y.-F., Wu, K.-N.: Tool support for learning Büchi automata and linear temporal logic. Presented at the Formal Methods in the Teaching Lab Workshop, Hamilton, Canada (August 2006)Google Scholar
  11. 11.
    Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings of the 1st Annual IEEE Symposium on Logic in Computer Science (LICS 1986), pp. 332–344 (1986)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Yih-Kuen Tsay
    • 1
  • Yu-Fang Chen
    • 1
  • Ming-Hsien Tsai
    • 1
  • Kang-Nien Wu
    • 1
  • Wen-Chin Chan
    • 1
  1. 1.Department of Information Management, National Taiwan UniversityTaiwan

Personalised recommendations