Handbook of theoretical computer science (vol. B)
Managing inconsistent specifications: reasoning, analysis, and action
ACM Transactions on Software Engineering and Methodology (TOSEM)
Handbook of defeasible reasoning and uncertainty management systems
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Inconsistency and Undefinedness in Z - A Practical Guide
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
Handling Inconsistencies in Z Using Quasi-Classical Logic
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
| Hi-index | 0.00 |
It has been widely recognized that inconsistencies often appear and are inevitable when specifying large and complex concurrent systems. The logic QCL (quasi-classical logic) has therefore been developed for handling such specifications. But, on the one hand, temporal aspects, significant for ensuring the correct behavior of concurrent systems, cannot be specified by QCL, on the other hand, Classical temporal logics like CTL (computation tree logic) fail for system specifications with inconsistent information due to the trivial inference problem. To bridge this gap, in this paper a non-classical temporal logic QCTL (quasi-classical temporal logic) is introduced, including a novel semantics in term of paraKripke structures and a sound and complete proof system. It is paraconsistent, i.e., it can be used to non-trivially reason about inconsistent system specifications. Furthermore, an example is presented, showing the use of QCTL for reasoning about concurrent systems containing inconsistent information.