This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the specification of liveness and fairness properties of computing systems as well as formalisation of many concepts of real analysis. These two modalities are also adequate in the sense that they can derive other important u...

[naeini1] in this paper, a new method is proposed to find the fuzzy optimal solution of fuzzy multi-objective linear programming problems (fmolpp) with fuzzy right hand side and fuzzy decision variables. due to the imprecise nature of available resources, determination of a definitive solution to the model seems impossible. therefore, the proposed model is designed in order to make fuzzy decisi...

The established approaches to the semantics of algebraic (equational) speciications are based on a category-theoretic perspective. When possible interpretations are viewed as a category, the extreme points|the initial and nal algebras|present themselves as natural candidates for the canonical interpretation. However, neither choice provides a satisfactory solution for incomplete speciications o...

This project proposes extensions of formal verification techniques, so as to bring finite state controllers of hybrid systems within the ambit of the verification framework. These controllers are represented using Kripke Structures whose states are labelled with Predicates Over Real Variables(PORVs). An extension to LTL is proposed, for representing the properties, and two model checking approa...

fuzzy logic has a high potential for managing the uncertainty sources associated with the medical expert systems. application of fuzzy inference model has been widely concentrated for managing uncertainties in computer based practices of medicine. this paper has proposed two fuzzy expert systems for prognosis of the heart disease based on: 1) mamdani inference model, and 2) sugeno inference mod...

We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the n+ 1valued Kripke models and a corresponding language based on a modal extension of Łukasiewicz many-valued logic. We illustrate the definitions by providing a framework for an analysis of the Rényi Ulam searching game with errors. Our main result is the axiomatization of t...

We deene a notion of Kripke logical predicate for models of classical linear logic. A Kripke logical predicate on a type A will be a set of generalised elements of A satisfying certain closure properties. Denotations of proofs of A will be characterised as those global elements of A satisfying all Kripke logical predicates on A.

Model checking and automated theorem proving are two pillars of formal methods. This paper investigates model checking from an automated theorem proving perspective, aiming at combining the expressiveness of automated theorem proving and the complete automaticity of model checking. The focus of this paper is on the verification of the temporal logic properties of Kripke models. The properties a...

System states space based on Kripke structure can be exhausted by model checking, thus system key property described by temporal logic can be automatically verified. Presently model checking has been widely used in hardware validation and network protocol analysis. Sliding window protocol is a classical receive-send protocol, which is used in TCP/IP protocol group. In this paper, we propose the...