Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Multi-Agent Systems

PRIMA 2014: PRIMA 2014: Principles and Practice of Multi-Agent Systems pp 107–115Cite as

Bounded Model Checking for Weighted Interpreted Systems and for Flat Weighted Epistemic Computation Tree Logic

  • Conference paper

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

Abstract

The paper deals with the SAT- and ROBDD-based bounded model checking (BMC) methods for the existential fragment of a flat weighted epistemic computation tree logic (FWECTLK) interpreted over weighted interpreted systems. We implemented the both BMC algorithms, and compared them with each other on several benchmarks for multi-agent systems.

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

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

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. Biere, A.: PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation 4, 75–97 (2008)

    MATH  Google Scholar 

  2. Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers 35(8), 677–691 (1986)

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  5. Gammie, P., van der Meyden, R.: MCK: Model checking the logic of knowledge. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 479–483. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Huth, M.R.A., Ryan, M.D.: Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press (2000)

    Google Scholar 

  7. Jones, A.V., Lomuscio, A.: Distributed BDD-based BMC for the verification of multi-agent systems. In: Proc. of AAMAS 2010, pp. 675–682. IFAAMAS (2010)

    Google Scholar 

  8. Lomuscio, A., Qu, H., Raimondi, F.: MCMAS: A model checker for the verification of multi-agent systems. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 682–688. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Męski, A., Woźna-Szcześniak, B.z., Zbrzezny, A.M., Zbrzezny, A.: Two approaches to bounded model checking for a soft real-time epistemic computation tree logic. In: Omatu, S., Neves, J., Rodriguez, J.M.C., Paz Santana, J.F., Gonzalez, S.R. (eds.) Distrib. Computing & Artificial Intelligence. AISC, vol. 217, pp. 483–491. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Męski, A., Penczek, W., Szreter, M., Woźna-Szcześniak, B., Zbrzezny, A.: BDD- versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance. Autonomous Agents and Multi-Agent Systems 28(4), 558–604 (2014)

    Article  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)

    MathSciNet  MATH  Google Scholar 

  13. Raimondi, F.: Model Checking Multi-Agent Systems. PhD thesis, UCL (2006)

    Google Scholar 

  14. Wooldridge, M.: An introduction to multi-agent systems, 2nd edn. John Wiley & Sons (2009)

    Google Scholar 

  15. Woźna-Szcześniak, B.: SAT-based bounded model checking for weighted deontic interpreted systems. In: Correia, L., Reis, L.P., Cascalho, J. (eds.) EPIA 2013. LNCS, vol. 8154, pp. 444–455. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Woźna-Szcześniak, B., Zbrzezny, A.M., Zbrzezny, A.: SAT-based bounded model checking for weighted interpreted systems and weighted linear temporal logic. In: Boella, G., Elkind, E., Savarimuthu, B.T.R., Dignum, F., Purvis, M.K. (eds.) PRIMA 2013. LNCS, vol. 8291, pp. 355–371. Springer, Heidelberg (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMCS, Jan Długosz University, Al. Armii Krajowej 13/15, 42-200, Czȩstochowa, Poland

    Bożena Woźna-Szcześniak, Agnieszka M. Zbrzezny & Andrzej Zbrzezny

  2. Department of Telecommunications, AGH University of Science and Technology, al. Mickiewicza 30, 30-059, Kraków, Poland

    Ireneusz Szcześniak

Authors
  1. Bożena Woźna-Szcześniak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ireneusz Szcześniak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Agnieszka M. Zbrzezny
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andrzej Zbrzezny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Software Engineering, University of Wollongong, Northfields Avenue, 2522, Wollongong, NSW, Australia

    Hoa Khanh Dam

  2. Imperial College, SW7 2BT, London, UK

    Jeremy Pitt

  3. University of Electronic Science and Technology of China, 610051, Chengdu, Sichuan, China

    Yang Xu

  4. NICTA Queensland Research Laboratory, GPO Box 2434, 4001, Brisbane, QLD, Australia

    Guido Governatori

  5. Nagoya Institute of Technology, Gokiso-cho, 466-8555, Showa-ku, Nagoya, Japan

    Takayuki Ito

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Woźna-Szcześniak, B., Szcześniak, I., Zbrzezny, A.M., Zbrzezny, A. (2014). Bounded Model Checking for Weighted Interpreted Systems and for Flat Weighted Epistemic Computation Tree Logic. In: Dam, H.K., Pitt, J., Xu, Y., Governatori, G., Ito, T. (eds) PRIMA 2014: Principles and Practice of Multi-Agent Systems. PRIMA 2014. Lecture Notes in Computer Science(), vol 8861. Springer, Cham. https://doi.org/10.1007/978-3-319-13191-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13191-7_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13190-0

  • Online ISBN: 978-3-319-13191-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation