• 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
  • More anti-chain based refinement checking

    Thumbnail
    View/Open
    DongPUB1992.pdf (1.037Mb)
    File version
    Accepted Manuscript (AM)
    Author(s)
    Wang, T
    Song, S
    Sun, J
    Liu, Y
    Dong, JS
    Wang, X
    Li, S
    Griffith University Author(s)
    Dong, Jin-Song
    Year published
    2012
    Metadata
    Show full item record
    Abstract
    Refinement checking plays an important role in system verification. It establishes properties of an implementation by showing a refinement relationship between the implementation and a specification. Recently, it has been shown that anti-chain based approaches increase the efficiency of trace refinement checking significantly. In this work, we study the problem of adopting anti-chain for stable failures refinement checking, failures-divergence refinement checking and probabilistic refine checking (i.e., a probabilistic implementation against a non-probabilistic specification). We show that the first two problems can be ...
    View more >
    Refinement checking plays an important role in system verification. It establishes properties of an implementation by showing a refinement relationship between the implementation and a specification. Recently, it has been shown that anti-chain based approaches increase the efficiency of trace refinement checking significantly. In this work, we study the problem of adopting anti-chain for stable failures refinement checking, failures-divergence refinement checking and probabilistic refine checking (i.e., a probabilistic implementation against a non-probabilistic specification). We show that the first two problems can be significantly improved, because the state space of the product model may be reduced dramatically. Though applying anti-chain for probabilistic refinement checking is more complicated, we manage to show improvements in some cases. We have integrated these techniques into the PAT model checking framework. Experiments are conducted to demonstrate the efficiency of our approach.
    View less >
    Journal Title
    Lecture Notes in Computer Science
    Volume
    7635 LNCS
    DOI
    https://doi.org/10.1007/978-3-642-34281-3_26
    Copyright Statement
    © 2012 Springer International Publishing AG. This is an electronic version of an article published in Lecture Notes In Computer Science (LNCS), 7635 LNCS pp. 364-380, 2012. Lecture Notes In Computer Science (LNCS) is available online at: http://link.springer.com// with the open URL of your article.
    Subject
    Software engineering not elsewhere classified
    Publication URI
    http://hdl.handle.net/10072/172908
    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