• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Journal articles
    • View Item
    • Home
    • Griffith Research Online
    • Journal articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • Model Checking of Transition-Labeled Finite-State Machines

    Thumbnail
    View/Open
    73659_1.pdf (511.2Kb)
    Author(s)
    Estivill-Castro, Vladimir
    Rosenblueth, David A
    Griffith University Author(s)
    Estivill-Castro, Vladimir
    Year published
    2011
    Metadata
    Show full item record
    Abstract
    We show that recent Model-driven Engineering that uses sequential finite state models in combination with a common sense logic is subject to efficient model checking. To achieve this, we first provide a formal semantics of the models. Using this semantics and methods for modeling sequential programs we obtain small Kripke structures. When considering the logics, we need to extend this to handle external variables and the possibilities of those variables been affected at any time during the execution of the sequential finite state machine. Thus, we extend the construction of the Kripke structure to this case. As ...
    View more >
    We show that recent Model-driven Engineering that uses sequential finite state models in combination with a common sense logic is subject to efficient model checking. To achieve this, we first provide a formal semantics of the models. Using this semantics and methods for modeling sequential programs we obtain small Kripke structures. When considering the logics, we need to extend this to handle external variables and the possibilities of those variables been affected at any time during the execution of the sequential finite state machine. Thus, we extend the construction of the Kripke structure to this case. As a proof of concept, we use a classical example of modeling a microwave behavior and producing the corresponding software directly from models. The construction of the Kripke structure has been implemented using {/tt flex}, {/tt bison} and {/tt C++}, and properties are verified using /NUSMV.
    View less >
    Journal Title
    Communications in Computer and Information Science
    Volume
    257
    DOI
    https://doi.org/10.1007/978-3-642-27207-3_8
    Copyright Statement
    © 2011 Springer-Verlag GmbH Berlin Heidelberg. This is an electronic version of an article published in Communications in Computer and Information Science, Vol. 257, pp. 61-73, 2011. Communications in Computer and Information Science is available online at: http://www.springerlink.com/ with the open URL of your article.
    Subject
    Software Engineering
    Publication URI
    http://hdl.handle.net/10072/43402
    Collection
    • Journal articles

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E
    • TEQSA: PRV12076

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander