On AGM Belief Revision for Computational Tree Logic

Marlo Souza

Abstract: Computation Tree Logic is a temporal logic proposed as a tool for formal design and verification of concurrent systems in which execution flows may have many possible branches. A specification of a concurrent system may thus be constructed using a relational model for this logic, and the formal verification of the system’s properties may be carried out through model checking. While CTL has obtained a great deal of success as a specification tool, there was a lack of systematic processes for reasoning about the revision and evolution of such specifications. Recently, some literature has proposed applying Belief Change techniques to the problem of revising CTL theories, with implications for revision of formal specifications of systems. This work expands this idea by proposing a Temporal Preference Logic, a multimodal logic with which we can reason about Belief Change in CTL. We show general results regarding the expressivity and decidability of some AGM Belief Revision operators for CTL.