CTL Model-Checking over Logics with Non-Classical Negations

Authors:
Marsha Chechik;Wendy MacCaull
Affiliations:
-;-
Venue:
ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
Year:
2003

Citing 0
Cited 3

Multi-valued symbolic model-checking

ACM Transactions on Software Engineering and Methodology (TOSEM)
On Designated Values in Multi-valued CTL^* Model Checking

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
On Designated Values in Multi-valued CTL^* Model Checking

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In earlier work [9], we defined CTL model-checking overfinite-valued logics with De Morgan negation. In this paper,we extend this work to logics with intuitionistic, Galoisand minimal negations, calling the resulting language\chiCTL. We define \chiCTL operators and show that they canbe computed using fixpoints. We further discuss how to extendour existing multi-valued model-checker \chiChek [8] toreasoning over these logics.