Results 161 to 170 of about 14,300 (195)

A Kripke Structure for the Ontology Alignment

2018 International Arab Conference on Information Technology (ACIT), 2018
In this paper, we propose a new way for the ontology alignment formalization using the Kripke structure in order to be able to exploiting a reliable tool as the Model checking. This later is a powerful mechanism for system verification. Here, the Kripke structures are used to model the behaviors of the ontology of alignment.
Manel Kolli
openalex   +2 more sources

Dynamic algebras which are not Kripke structures

, 2005
The first example of a dynamic algebra which is not isomorphic to any Kripke structure was given by Kozen [8]. We analyze properties of dynamic algebras to get general arguments making it possible to construct a lot of other examples.
Jan Reiterman, Věra Trnková
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Lattice-Valued Kripke Structures Based on Complete Residuated Lattice

2012 IEEE Sixth International Conference on Software Security and Reliability Companion, 2012
We introduce the lattice-valued Kripke structures, for the purpose of allowing imprecise or incomplete specifications to be expressed, by extending the traditional notion of Kripke structures in the context of complete residuated lattice. Moreover, we show how the traditional trace inclusion and equivalence, can be lifted to a setting of quantitative ...
Haiyu Pan, Min Zhang, Yixiang Chen
openaire   +3 more sources

Model Checking Modal Transition Systems Using Kripke Structures

, 2002
We reduce the modal mu-calculus model-checking problem for Kripke modal transition systems to the modal mu-calculus modelchecking problem for Kripke structures. This reduction is sound, preserves the alternation-depth fragments of the modal mu-calculus, is linear in the size of formulas and models, and extends the reach of modal mu-calculus model ...
Michael Huth
openalex   +2 more sources

POSSIBILISTIC KRIPKE STRUCTURE DECISION PROCESSES

Quantitative Logic and Soft Computing, 2012
Yan Xue, Lei Hong-xuan, Yongming Li
openalex   +2 more sources

Proof of program correctness based on Kripke structure

Journal of Computer Applications, 2011
Yu Jiankun
  +4 more sources

CSP and Kripke Structures

2015
A runtime verification technique has been developed for CSP via translation of CSP models to Kripke structures. With this technique, we can check that a system under test satisfies properties of traces and refusals of its CSP model. This complements analysis facilities available for CSP and for all languages with a CSP-based semantics:i¾?Safety ...
Cavalcanti, Ana, Huang, Wen-ling, Peleska, Jan, Woodcock, Jim   +3 more
openaire   +1 more source

Weak Kripke Structures and LTL

2011
We revisit the complexity of the model checking problem for formulas of linear-time temporal logic (LTL). We show that the classic PSPACE-hardness result is actually limited to a subclass of the Kripke frames, which is characterized by a simple structural condition: the model checking problem is only PSPACE-hard if there exists a strongly connected ...
Lars Kuhtz, Bernd Finkbeiner
openaire   +1 more source

Formalizing a Use Case to a Kripke Structure

Software Engineering and Applications/ 831: Advances in Power and Energy Systems, 2015
The use case artifact is the de facto standard to represent functional requirements of a software and can be used to verify and analyze the requirements throughout the development process. Consistent and unambiguous requirements are documented using formal representation techniques.
Qamar uz Zaman, Muddassar Azam Sindhu, Aamer Nadeem   +2 more
openaire   +1 more source

MODEL-CHECKING OF LINEAR-TIME PROPERTIES IN POSSIBILISTIC KRIPKE STRUCTURE

Quantitative Logic and Soft Computing, 2012
Lijun Li, Yongming Li
openalex   +2 more sources