Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
