Concepts as Modalities in Description Logics

Motivated by the colloquial language term of a “glass gummy bear”, an additional type of concept composition for description logics is suggested. This composition type is then axiomatically formalized and called concept generalization. Consistency of the formalization is checked. By proving axiom K and Go ̈del rule, it is shown that this logic is in fact a multi-modal logic. Concepts could be both modal operators and predicate symbols. A Kripke semantics is presented (the adequacy is future work). In this semantics, the TBox axioms hold for any view, assertions in the ABox hold for the natural view (a selected world in the Kripke structure) only. The relationship to other formalisms is outlined. Further examples are discussed at the end.

Model Checking Approach for Deadlock Detection in an Operating System Process-Resource Graph Using Dynamic Model Generating and Computation Tree Logic Specification

Deadlock between processes and resources is a serious problem in development of operating system. Multiple methods were invented to deal with deadlock issue. Deadlock detection is one method that allows a deadlock to take place then detects thereafter which processes and resources have caused it. In traditional process-resource graph, we propose an approach to detect a deadlock by implementing model checking technique and Computation Tree Logic (CTL) specification. In this paper, we modified traditional process-resource graph such that the outcome graph satisfied valid model of Kripke structure, which over- came limitations of traditional representation of process-resource graph and still preserved every proposition, correctness, and property of the system. With the modified graph, we designed a CTL specification that verified whether or not there existed a deadlock caused by one or more pairs of process and resource. A Java application was developed to implement the proposed approach such that it was capable of dynamically generating a valid model for any process-resource graph input, dynamically generating CTL formula for specification, and verifying the model with corresponding CTL formula.

The Investigation of TLC Model Checker Properties

This paper presents the investigation and comparison of TLC model checking method (TLA Checker) properties. There are two different approaches to method usage which are considered. The first one consists of a transition system states attendance by breadth-first search (BFS), and the second one by depth-first search (DFS). The Kripke structure has been chosen as a transition system model. A case study has been conducted, where composite web service usage scenario has been considered. Obtained experimental results are aimed at increasing the effectiveness of TLA+ specifications automated verification.

Semantic Consistency Checking in Building Ontology from Heterogeneous Sources

Semantic collision is inevitable while building a domain ontology from heterogeneous data sources (semi-)automatically. Therefore, the semantic consistency is indispensable precondition for building a correct ontology. In this paper, a model-checking-based method is proposed to handle the semantic consistency problem with a kind of middle-model methodology, which could extract a domain ontology from structured and semistructured data sources semiautomatically. The method translates the middle model into the Kripke structure, and consistency assertions into CTL formulae, so a consistency checking problem is promoted to a global model checking. Moreover, the feasibility and correctness of the transformation is proved, and case studies are provided.

Model Checking for SpaceWire Error Detection Module

Considerable attention has been devoted to prove the correctness of programs. Formal verification overcomes the incompleteness by applying mathematical methods to verify a design. SpaceWire is a well known communication standard. For safety-critical applications an approach is needed to validate the completeness of SpareWire design. This paper addresses formal verification of SpareWire error detection module. The system model was constructed by Kripke structure, and the properties were presented by linear temporal logic (LTL). Compared the verification of LTL with CTL (branch temporal logic), LTL properties could improve the verification efficiency due to its linear search. The error priority was checked using simulation guided by model checking. After some properties were modified, all possible behaviors of the module satisfied the specification. This method realizes complete validation of the error detection module.