Log in

Relevant bibliographies by topics / Structures de Kripke

Contents

Journal articles

Academic literature on the topic 'Structures de Kripke'

Author: Grafiati

Published: 4 June 2021

Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Structures de Kripke.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Structures de Kripke"

1

Knapik, Michał, and Wojciech Penczek. "Parameter Synthesis for Timed Kripke Structures." Fundamenta Informaticae 133, no. 2-3 (2014): 211–26. http://dx.doi.org/10.3233/fi-2014-1072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

MARCELINO, SÉRGIO, and PEDRO RESENDE. "An algebraic generalization of Kripke structures." Mathematical Proceedings of the Cambridge Philosophical Society 145, no. 3 (2008): 549–77. http://dx.doi.org/10.1017/s0305004108001667.

Full text

Abstract:

AbstractThe Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional algebraic semantics based on lattices with unary operators, and it suggests natural interpretations of modal logic, of possible interest in the applications, in structures that arise in geometry and analysis, such as foliated manifolds and operator algebras, via topological groupoids and inverse semigroups. We study completeness properties of the quantale based semantics for the systems K, T, K4, S4 and S5, in particular obtaining an axiomatization for S5 which does not use negation or the modal necessity operator. As additional examples we describe intuitionistic propositional modal logic, the logic of programs PDL and the ramified temporal logic CTL.

APA, Harvard, Vancouver, ISO, and other styles

3

Pinto, M. C. "Separable Kripke structures are algebraically universal." Algebra Universalis 42, no. 1-2 (1999): 17–48. http://dx.doi.org/10.1007/s000120050121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Pan, Haiyu, Min Zhang, Hengyang Wu, and Yixiang Chen. "Quantitative Analysis of Lattice-valued Kripke Structures." Fundamenta Informaticae 135, no. 3 (2014): 269–93. http://dx.doi.org/10.3233/fi-2014-1122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Buss, Samuel R. "Intuitionistic validity in T-normal Kripke structures." Annals of Pure and Applied Logic 59, no. 3 (1993): 159–73. http://dx.doi.org/10.1016/0168-0072(93)90091-q.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ranzato, Francesco. "An efficient simulation algorithm on Kripke structures." Acta Informatica 51, no. 2 (2014): 107–25. http://dx.doi.org/10.1007/s00236-014-0195-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Browne, M. C., E. M. Clarke, and O. Grümberg. "Characterizing finite Kripke structures in propositional temporal logic." Theoretical Computer Science 59, no. 1-2 (1988): 115–31. http://dx.doi.org/10.1016/0304-3975(88)90098-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

KUPFERMAN, ORNA, and YOAD LUSTIG. "LATTICED SIMULATION RELATIONS AND GAMES." International Journal of Foundations of Computer Science 21, no. 02 (2010): 167–89. http://dx.doi.org/10.1142/s0129054110007192.

Full text

Abstract:

Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed Kripke structures, in which the elements in the set are partially ordered, are useful in abstraction, query checking, and reasoning about multiple view-points. The challenges that formal methods involve in the Boolean setting are carried over, and in fact increase, in the presence of multi-valued systems and logics. We lift to the latticed setting two basic notions that have been proven useful in the Boolean setting. We first define latticed simulation between latticed Kripke structures. The relation maps two structures M1 and M2 to a lattice element that essentially denotes the truth value of the statement "every behavior of M1 is also a behavior of M2". We show that latticed-simulation is logically characterized by the universal fragment of latticed µ-calculus, and can be calculated in polynomial time. We then proceed to defining latticed two-player games. Such games are played along graphs in which each transition have a value in the lattice. The value of the game essentially denotes the truth value of the statement "the ∨-player can force the game to computations that satisfy the winning condition". An earlier definition of such games involved a zig-zagged traversal of paths generated during the game. Our definition involves a forward traversal of the paths, and it leads to better understanding of multi-valued games. In particular, we prove a min-max property for such games, and relate latticed simulation with latticed games.

APA, Harvard, Vancouver, ISO, and other styles

9

Foshammer, Louise, Kim Guldstrand Larsen, and Anders Mariegaard. "Weighted Branching Simulation Distance for Parametric Weighted Kripke Structures." Electronic Proceedings in Theoretical Computer Science 220 (July 31, 2016): 63–75. http://dx.doi.org/10.4204/eptcs.220.6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fernández-Duque, David, and Joost J. Joosten. "Models of transfinite provability logic." Journal of Symbolic Logic 78, no. 2 (2013): 543–61. http://dx.doi.org/10.2178/jsl.7802110.

Full text

Abstract:

AbstractFor any ordinal Λ, we can define a polymodal logic GLPΛ, with a modality [ξ] for each ξ < Λ. These represent provability predicates of increasing strength. Although GLPΛ has no Kripke models, Ignatiev showed that indeed one can construct a Kripke model of the variable-free fragment with natural number modalities, denoted . Later, Icard defined a topological model for which is very closely related to Ignatiev's.In this paper we show how to extend these constructions for arbitrary Λ. More generally, for each Θ, Λ we build a Kripke model and a topological model , and show that is sound for both of these structures, as well as complete, provided Θ is large enough.

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!