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

  • Authors:
  • Joeri Engelfriet;Catholijn M. Jonker;Jan Treur

  • Affiliations:
  • Department of Artificial Intelligence, Vrije Universiteit Amsterdam De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands. E-mail: joeri@cs.vu.nl, URL: http://www.cs.vu.nl/& ...;Department of Artificial Intelligence, Vrije Universiteit Amsterdam De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands. E-mail: jonker@cs.vu.nl, URL: http://www.cs.vu.nl/ ...;Department of Artificial Intelligence, Vrije Universiteit Amsterdam De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands. E-mail: treur@cs.vu.nl, URL: http://www.cs.vu.nl/& ...

  • Venue:
  • Journal of Logic, Language and Information
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.