Skip to main content
Log in

Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

Compositional verification aims at managing the complexity of theverification process by exploiting compositionality of the systemarchitecture. In this paper we explore the use of a temporal epistemiclogic to formalize the process of verification of compositionalmulti-agent systems. The specification of a system, its properties andtheir proofs are of a compositional nature, and are formalized within acompositional temporal logic: Temporal Multi-Epistemic Logic. It isshown that compositional proofs are valid under certain conditions.Moreover, the possibility of incorporating default persistence ofinformation in a system, is explored. A completion operation on aspecific type of temporal theories, temporal completion, is introducedto be able to use classical proof techniques in verification withrespect to non-classical semantics covering default persistence.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abadi, M. and Lamport, L., 1993, “Composing specifications,” ACM Transactions on Programming Languages and Systems 15, 73–132.

    Google Scholar 

  • Barringer, H., Fisher, M., Gabbay, D., and Hunter, A., 1991, “Meta-reasoning in executable temporal logic,” pp. 40–49 in Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, KR'91, J. Allen, R. Fikes, and E. Sandewall, eds., San Francisco, CA: Morgan Kaufmann Publishers.

    Google Scholar 

  • Barringer, H., Fisher, M., Gabbay, D., Owens, R., and Reynolds, M., 1996, The Imperative Future: Principles of Executable Temporal Logic, Research Studies Press and New York: John Wiley & Sons.

    Google Scholar 

  • Benerecetti, M., Giunchiglia, F., and Serafini, L., 1999, “A model-checking algorithm for multiagent systems,” pp. 163–176 in Intelligent Agents V, Proceedings of the International Workshop on Agent Theories, Architectures and Languages, ATAL'98, Lecture Notes in Artificial Intelligence, Vol. 1555, J.P. Müller, M.P. Singh, and A.S. Rao, eds., Berlin: Springer-Verlag.

    Google Scholar 

  • Brazier, F.M.T., Dunin-Keplicz, B.M., Jennings, N.R., and Treur, J., 1995, “Formal specification of multi-agent systems: A real world case,” pp. 25–32 in Proceedings of the First International Conference on Multi-Agent Systems, V. Lesser, ed., Cambridge, MA: MIT Press. Extended version in International Journal of Co-operative Information Systems, IJCIS 6, Special Issue on Formal Methods in Co-operative Information Systems: Multi-Agent Systems, M. Huhns and M. Singh, eds., pp. 67-94.

    Google Scholar 

  • Brazier, F.M.T., Cornelissen, F., Gustavsson, R., Jonker, C.M., Lindeberg, O., Polak, B., and Treur, J., 1998, “Compositional design and verification of a multi-agent system for one-to-many negotiation,” pp. 49–56 in Proceedings of the Third International Conference on Multi-Agent Systems, Y. Demazeau, ed., New York: IEEE Computer Society Press.

    Google Scholar 

  • Cornelissen, F., Jonker, C.M., and Treur, J., 1997, “Compositional verification of knowledge-based systems: A case study for diagnostic reasoning,” pp. 65–80 in Knowledge Acquisition, Modelling and Management, Proceedings of the 10th EKAW, E. Plaza and R Benjamins, eds., Lecture Notes in Artificial Intelligence, Vol. 1319, Berlin: Springer-Verlag.

    Google Scholar 

  • Dams, D., Gerth, R., and Kelb, P., 1996, “Practical symbolic model checking of the full µ-calculus using compositional abstractions,” Report, Eindhoven University of Technology, Department of Mathematics and Computer Science.

  • Engelfriet, J., 1996, “Minimal temporal epistemic logic,” Notre Dame Journal of Formal Logic 37, 233–259 (Special issue on Combining Logics). 224 J. ENGELFRIET ET AL.

    Google Scholar 

  • Engelfriet, J. and Treur, J., 1996a, “Specification of nonmonotonic reasoning,” pp. 111–125 in Proceedings International Conference on Formal and Applied Practical Reasoning, D.M. Gabbay and H.J. Ohlbach, eds., Lecture Notes in Artificial Intelligence, Vol. 1085, Berlin: Springer-Verlag. Extended version in Journal of Applied Non-Classical Logic 10, 2000, 7-27.

    Google Scholar 

  • Engelfriet, J. and Treur, J., 1996b, “Executable temporal logic for nonmonotonic reasoning,” Journal of Symbolic Computation 22, 615–625.

    Google Scholar 

  • Engelfriet, J. and Treur, J., 1997, “An interpretation of default logic in temporal epistemic logic,” Journal of Logic, Language and Information 7, 369–388.

    Google Scholar 

  • Fagin, R., Halpern, J.Y., Moses, Y., and Vardi, M.Y., 1995, Reasoning about Knowledge, Cambridge, MA: MIT Press.

    Google Scholar 

  • Fensel D. and Benjamins, R., 1996, “Assumptions in model-based diagnosis,” pp. 5/1–5/18 in Proceedings of the 10th Banff Knowledge Acquisition for Knowledge-Based Systems Workshop, B.R. Gaines and M.A. Musen, eds., Calgary: SRDG Publications, Department of Computer Science, University of Calgary.

    Google Scholar 

  • Fensel, D., Schonegge, A., Groenboom, R., and Wielinga, B., 1996, “Specification and verification of knowledge-based systems,” pp. 4/1–4/20 in Proceedings of the 10th Banff Knowledge Acquisition for Knowledge-Based Systems Workshop, B.R. Gaines and M.A. Musen, eds., Calgary: SRDG Publications, Department of Computer Science, University of Calgary.

    Google Scholar 

  • Finger, M. and Gabbay, D., 1992, “Adding a temporal dimension to a logic system,” Journal of Logic, Language and Information 1, 203–233.

    Google Scholar 

  • Fisher, M., 1994, “A survey of Concurrent METATEM— The language and its applications,” pp. 480–505 in Temporal Logic — Proceedings of the First International Conference, D.M. Gabbay and H.J. Ohlbach, eds., Lecture Notes in Artificial Intelligence, Vol. 827, Berlin: Springer-Verlag.

    Google Scholar 

  • Fisher, M. and Wooldridge, M., 1997, “On the formal specification and verification of multi-agent systems,” International Journal of Co-operative Information Systems, IJCIS 6, Special issue on Formal Methods in Co-operative Information Systems: Multi-Agent Systems, M. Huhns and M. Singh, eds., pp. 37–65.

  • Giunchiglia, E., Traverso, P., and Giunchiglia, F., 1993, “Multi-context systems as a specification framework for complex reasoning systems,” pp. 45–72 in Formal Specificiation and Complex Reasoning Systems, J. Treur and T. Wetter, eds., New York: Ellis Horwood.

    Google Scholar 

  • Giunchiglia, F. and Serafini, L., 1994, “Multilanguage hierarchical logics (or: How we can do without modal logics),” Artificial Intelligence 65, 29–70.

    Google Scholar 

  • Halpern, J. and Vardi, M.Y., 1986, “The complexity of reasoning about knowledge and time,” pp. 304–315 in Proceedings of the 18th ACM Symposium on the Theory of Computing. Journal version in Journal of Computer and System Sciences 38, 1989, 195-237.

    Google Scholar 

  • Halpern, J., van der Meyden, R., and Vardi, M.Y., 1999, “Complete axiomatizations for reasoning about knowledge and time,” Report.

  • Hooman, J., 1994, “Compositional verification of a distributed real-time arbitration protocol,” Real-Time Systems 6, 173–206.

    Google Scholar 

  • Jonker, C.M. and Treur, J., 1998, “Compositional verification of multi-agent Systems: A formal analysis of pro-activeness and reactiveness,” pp. 350–380 in Proceedings of the International Symposium on Compositionality, COMPOS'97, W.P. De Roever, H. Langmaack, and A. Pnueli, eds., Lecture Notes in Computer Science, Vol. 1536, Berlin: Springer-Verlag. Extended version in International Journal of Co-perative Information Systems, to appear.

    Google Scholar 

  • Konolige, K., 1986, A Deduction Model of Belief, London: Pitman.

    Google Scholar 

  • Treur, J. and Wetter, T., 1993, Formal Specification of Complex Reasoning Systems, New York: Ellis Horwood.

    Google Scholar 

  • Treur, J. and Willems, M., 1994, “A logical foundation for verification,” pp. 745–749 in Proceedings of the Eleventh European Conference on Artificial Intelligence, ECAI'94, A.G. Cohn, ed., New York: John Wiley & Sons. COMPOSITIONAL VERIFICATION OF MULTI-AGENT SYSTEMS 225

    Google Scholar 

  • van Benthem, J.F.A.K., 1983, The Logic of Time: A Model-Theoretic Investigation into the Varieties of Temporal Ontology and Temporal Discourse, Dordrecht: Reidel.

    Google Scholar 

  • van der Meyden, R., 1994, “Axioms for knowledge and time in distributed systems with perfect recall, pp. 448–457 in Proceedings IEEE Symposium on Logic in Computer Science, Paris, July, New York: IEEE.

    Google Scholar 

  • van Harmelen, F., Malec, J., Lopez de Manataras, R., and Treur, J., 1993, “Comparing formal specification languages for complex reasoning systems,” pp. 257–282 in Formal Specification of Complex Reasoning Systems, J. Treur and T. Wetter, eds., New York: Ellis Horwood.

    Google Scholar 

  • van Langevelde, I.A., Philipsen, A.W., and Treur, J., 1992, “Formal specification of compositional architectures,” pp. 272–276 in Proceedings 10th European Conference on Artificial Intelligence, ECAI'92, B. Neumann, ed., New York: John Wiley and Sons.

    Google Scholar 

  • Wooldridge, M.J. and Jennings, N.R., 1995, “Intelligent agents: Theory and practice,” Knowledge Engineering Review 10, 115–152.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Engelfriet, J., Jonker, C.M. & Treur, J. Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic. Journal of Logic, Language and Information 11, 195–225 (2002). https://doi.org/10.1023/A:1017588004618

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1017588004618

Navigation