• 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
    • Conference outputs
    • View Item
    • Home
    • Griffith Research Online
    • Conference outputs
    • 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
  • Verification of Multi-agent Systems Via Bounded Model Checking

    Thumbnail
    View/Open
    40254.pdf (151.7Kb)
    Author(s)
    Luo, Xiangyu
    Su, Kaile
    Sattar, Abdul
    Reynolds, Mark
    Griffith University Author(s)
    Sattar, Abdul
    Su, Kaile
    Year published
    2006
    Metadata
    Show full item record
    Abstract
    We present a bounded model checking (BMC) approach to the verification of temporal epistemic properties of multi-agent systems. We extend the temporal logic CTL* by incorporating epistemic modalities and obtain a temporal epistemic logic that we call CTL*K. CTL*K logic is interpreted under the semantics of synchronous interpreted systems. Though CTL*K is of great expressive power in both temporal and epistemic dimensions, we show that BMC method is still applicable for the universal fragment of CTL*K. We present in some detail a BMC algorithm and prove its correctness. In our approach, agents' knowledge interpreted in ...
    View more >
    We present a bounded model checking (BMC) approach to the verification of temporal epistemic properties of multi-agent systems. We extend the temporal logic CTL* by incorporating epistemic modalities and obtain a temporal epistemic logic that we call CTL*K. CTL*K logic is interpreted under the semantics of synchronous interpreted systems. Though CTL*K is of great expressive power in both temporal and epistemic dimensions, we show that BMC method is still applicable for the universal fragment of CTL*K. We present in some detail a BMC algorithm and prove its correctness. In our approach, agents' knowledge interpreted in synchronous semantics can be skilfully attained by the state position function, which avoids extending the encoding of the states and the transition relations of the plain temporal epistemic model for time domain.
    View less >
    Conference Title
    AI 2006: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS
    Volume
    4304
    Publisher URI
    http://www.springer.com/east/home?SGWID=5-102-22-173705727-0&changeHeader=true
    Copyright Statement
    © 2006 Springer : Reproduced in accordance with the copyright policy of the publisher : The original publication will be available at SpringerLink (use hypertext links)
    Publication URI
    http://hdl.handle.net/10072/11925
    Collection
    • Conference outputs

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E

    Tagline

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