| Full text | |
| Author(s): |
Guerra, Paulo T.
;
Wassermann, Renata
Total Authors: 2
|
| Document type: | Journal article |
| Source: | JOURNAL OF LOGIC LANGUAGE AND INFORMATION; v. 31, n. 4, p. 28-pg., 2022-08-06. |
| Abstract | |
Although formal system verification has been around for many years, little attention was given to the casewhere the specification of the system has to be changed. This may occur due to a failure in capturing the clients' requirements or due to some change in the domain (think for example of banking systems that have to adapt to different taxes being imposed). We are interested in having methods not only to verify properties, but also to suggest how the system model should be changed so that a property would be satisfied. For this purpose, we will use techniques from the area of Belief Revision, that deals with the problem of changing a knowledge base in view of new information. In the last thirty years, several authors have contributed with change operations and ways of characterizing them. However, most of the work concentrates on knowledge bases represented using classical propositional logic. In the last decade, there have been efforts to apply belief revision theory to description and modal logics. In this work, we analyze what is needed for a theory of belief revision which can be applied to the temporal logic, such as the Computation Tree Logic (CTL). In particular, we illustrate different alternatives for formalizing the concept of revision of CTL. Our interest in this particular logic comes both from practical issues, since it is used for software specification, as from theoretical issues, as it is a non-compact logic and most existing results rely on compactness. We focus here on the revision of CTL models and present a characterization result for the revision of partial models. (AU) | |
| FAPESP's process: | 10/15392-3 - Revision of CTL Models |
| Grantee: | Paulo de Tarso Guerra Oliveira |
| Support Opportunities: | Scholarships in Brazil - Doctorate |