Formal verification methods model systems by Kripke structures. In order to model live behaviors of systems, Kripke structures are augmented with fairness conditions. Such conditions partition the computations of the systems into fair computations, with respect to which verification proceeds, and unfair computations, which are ignored. Reasoning about Kripke structures augmented with fairness i...

We introduce the class of rational Kripke models and study symbolic model checking of the basic tense logic Kt and some extensions of it in models from that class. Rational Kripke models are based on (generally infinite) rational graphs, with vertices labeled by the words in some regular language and transitions recognized by asynchronous two-head finite automata, also known as rational transdu...

all practical digital circuits are usually a mixture of combinational and sequential logic. flip–flops are essential to sequential logic therefore fuzzy flip–flops are considered to be among the most essential topics of fuzzy digital circuit. the concept of fuzzy digital circuit is among the most interesting applications of fuzzy sets and logic due to the fact that if there has to be an ultimat...

We show how to generate multi-agent Kripke models from message exchanges, and conversely, how to interpret message exchanges with respect to initial multi-agent Kripke models. Any multimodal S5 Kripke model is a suitable initial model for updating by means of message exchange.

Motivated by the problem of extending stable semantics (SS) and well-founded semantics (WFS) while avoiding their drawbacks, we propose a new simple and intuitive semantics for (normal) logic programs, called canonical Kripke model semantics. Our approach is based on formulating stability in an intuitionistic framework which helps us overcome several drawbacks. As a consequence, every normal pr...

In [10], Kripke gave a definition of the semantics of the intuitionistic logic. Fitting [2] showed that Kripke's models are equivalent to algebraic models (i.e., pseudo-Boolean models) in a certain sense. As a corollary of this result, we can show that any partially ordered set is regarded as a (characteristic) model of a intermediate logic ̂ We shall study the relations between intermediate log...