Extended full computation-tree logics for paraconsistent model checking
- 15 March 2007
- journal article
- research article
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 15 (3) , 251-276-276
Abstract
It is known that the full computation-tree logic CTL * is an important base logic for model checking. The bisimulation theorem for CTL* is known to be useful for abstraction in model checking. In this paper, the bisimulation theorems for two paraconsistent four-valued extensions 4CTL* and 4LCTL* of CTL* are shown, and a translation from 4CTL* into CTL* is presented. By using 4CTL* and 4LCTL*, inconsistency-tolerant and spatiotemporal reasoning can be expressed as a model checking framework.Keywords
This publication has 4 references indexed in Scilit:
- Linear and affine logics with temporal, spatial and epistemic operatorsTheoretical Computer Science, 2006
- Bipolar possibility theory in preference modeling: Representation, fusion and optimal solutionsInformation Fusion, 2006
- A spatial modal logic with a location interpretationMathematical Logic Quarterly, 2005
- Relations in biomedical ontologiesGenome Biology, 2005