Results 1 to 10 of about 14,300 (195)

Weighted Branching Simulation Distance for Parametric Weighted Kripke Structures [PDF]

open access: diamondElectronic Proceedings in Theoretical Computer Science, 2016
This paper concerns branching simulation for weighted Kripke structures with parametric weights. Concretely, we consider a weighted extension of branching simulation where a single transitions can be matched by a sequence of transitions while preserving ...
Louise Foshammer   +2 more
doaj   +11 more sources

An algebraic generalization of Kripke structures [PDF]

open access: greenMathematical Proceedings of the Cambridge Philosophical Society, 2007
The 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.
Emerson   +8 more
core   +5 more sources

Saturated Kripke Structures as Vietoris Coalgebras [PDF]

open access: greenLecture Notes in Computer Science, 2022
We show that the category of coalgebras for the compact Vietoris endofunctor $\mathbb{V}$ on the category Top of topological spaces and continuous mappings is isomorphic to the category of all modally saturated Kripke structures. Extending a result of Bezhanishvili, Fontaine and Venema, we also show that Vietoris subcoalgebras as well as bisimulations ...
H. Peter Gumm, Mona Taheri
exaly   +5 more sources

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic [PDF]

open access: diamondScientific Annals of Computer Science, 2016
Software product lines are now an established framework for software design. They are specified by special diagrams called feature models. For formal analysis, the latter are usually encoded by Boolean propositional theories.
Z. Diskin   +3 more
doaj   +3 more sources

Characterizing Kripke structures in temporal logic [PDF]

open access: bronze, 1987
Abstract : The question of whether branching-time temporal logic or linear-time temporal logic is best for reasoning about concurrent programs is one of the most controversial issues in logics of programs. Concurrent programs are usually modelled by labelled state-transition graphs in which some state is designated as the initial state.
M. C. Browne   +2 more
  +5 more sources

On the Verification of Weighted Kripke Structures Under Uncertainty [PDF]

open access: green, 2018
We study the problem of checking weighted CTL properties for weighted Kripke structures in presence of imprecise weights. We consider two extensions of the notion of weighted Kripke structures, namely (i) parametric weighted Kripke structures, having transitions weights modelled as affine maps over a set of parameters and, (ii) weight-uncertain Kripke ...
Giovanni Bacci   +2 more
  +5 more sources

The hardware modeling and analysis techniques based on Kripke structure [PDF]

open access: hybridAdvances in Computer Science Research, 2015
This paper focuses on two aspects. One is the modeling method of hardware function based on Kripke structure. The other is the hardware design specification formal description method which based on temporal logic CTL. In order to design a hardware modeling method which based on Kripke Structure, Hardware implementation process and behavioral ...
Xiao Da   +4 more
openalex   +2 more sources

A More Efficient Simulation Algorithm on Kripke Structures [PDF]

open access: green, 2013
A number of algorithms for computing the simulation preorder (and equivalence) on Kripke structures are available. Let Σ denote the state space, → the transition relation and P sim the partition of Σ induced by simulation equivalence. While some algorithms are designed to reach the best space bounds, whose dominating additive term is |P sim|2, other ...
Francesco Ranzato
openalex   +4 more sources

Computing (bi)simulation relations preserving CTL*x. for ordinary and fair Kripke structures.

open access: greenТруды Института системного программирования РАН, 2007
The main goal of model checking is to verify whether a model of a given program satisfies some given specification. In this paper models are regarded as fair or ordinary Kripke structures whereas specifications are represented by formulae branching-time ...
P.E. Bulychev   +2 more
doaj   +1 more source

An efficient simulation algorithm on Kripke structures [PDF]

open access: closedActa Informatica, 2014
Conference version appeared in Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13)
Francesco Ranzato
openalex   +5 more sources

Home - About - Disclaimer - Privacy