Skip to main content

SAT-Based Bounded Model Checking for Weighted Deontic Interpreted Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8154))

Abstract

In this paper we present a SAT-based Bounded Model Checking (BMC) method for weighted deontic interpreted systems (i.e., Kripke structures where transitions carry a weight, which is an arbitrary natural number) and properties expressed in the existential fragment of a weighted temporal logic augmented to include knowledge and deontic components (Wectlkd). In particular, since in BMC both the system model and the checked property are translated into a Boolean formula to be analysed by a SAT-solver, we introduce a new Boolean encoding of the Wectlkd formulae that is particularly optimized for managing quantitative weighted temporal operators, knowledge operators, and deontic operators, which are typically found in properties of complex multi-agent systems in models of which we assume the possibility that agents may not behave as they are supposed to, and that acting (coordination, negotiation, cooperation, etc.) of agents may cost. We illustrate how the weighted deontic interpreted systems can be applied to the analysis of a variant of the standard bit transmission problem in which an agent may fail to do something it is supposed to do.

Partly supported by National Science Center under the grant No. 2011/01/B/ST6/ 05317.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lomuscio, A., Sergot, M.: Violation, error recovery, and enforcement in the bit transmission problem. In: Proceedings of DEON 2002. Imperial College Press (2002)

    Google Scholar 

  2. Cabodi, G., Camurati, P., Quer, S.: Can BDDs compete with SAT solvers on bounded model checking? In: Proceedings of DAC 2002, pp. 117–122. ACM (2002)

    Google Scholar 

  3. Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design 19(1), 7–34 (2001)

    Article  MATH  Google Scholar 

  4. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press (1999)

    Google Scholar 

  5. Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, ch. 16, pp. 996–1071. Elsevier Science Publishers (1990)

    Google Scholar 

  6. Fabre, E., Jezequel, L.: Distributed optimal planning: an approach by weighted automata calculus. In: Proceedings of CDC 2009, pp. 211–216. IEEE (2009)

    Google Scholar 

  7. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  8. Levesque, H.: A logic of implicit and explicit belief. In: Proceedings of the 6th National Conference of the AAAI, pp. 198–202. Morgan Kaufman (1984)

    Google Scholar 

  9. Lomuscio, A., Sergot, M.: Deontic interpreted systems. Studia Logica 75(1), 63–92 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Markey, N., Schnoebelen, P.: Symbolic model checking of simply-timed systems. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS/FTRTFT 2004. LNCS, vol. 3253, pp. 102–117. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Męski, A., Penczek, W., Szreter, M., Woźna-Szcześniak, B., Zbrzezny, A.: Two approaches to bounded model checking for linear time logic with knowledge. In: Jezic, G., Kusek, M., Nguyen, N.-T., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2012. LNCS, vol. 7327, pp. 514–523. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Penczek, W., Lomuscio, A.: Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae 55(2), 167–185 (2003)

    MATH  MathSciNet  Google Scholar 

  13. Wooldridge, M.: An introduction to multi-agent systems. John Wiley (2002)

    Google Scholar 

  14. Woźna-Szcześniak, B., Zbrzezny, A., Zbrzezny, A.: The BMC method for the existential part of RTCTLK and interleaved interpreted systems. In: Antunes, L., Pinto, H.S. (eds.) EPIA 2011. LNCS, vol. 7026, pp. 551–565. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Zbrzezny, A.: Improving the translation from ECTL to SAT. Fundamenta Informaticae 85(1-4), 513–531 (2008)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Woźna-Szcześniak, B. (2013). SAT-Based Bounded Model Checking for Weighted Deontic Interpreted Systems. In: Correia, L., Reis, L.P., Cascalho, J. (eds) Progress in Artificial Intelligence. EPIA 2013. Lecture Notes in Computer Science(), vol 8154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40669-0_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40669-0_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40668-3

  • Online ISBN: 978-3-642-40669-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics