Results 151 to 160 of about 14,300 (195)
Formal modeling of a causal consistent distributed system and verification of its history <i>via</i> model checking using colored Petri net. [PDF]
Alsaegg KAM +2 more
europepmc +1 more source
Efficacy and safety of lemborexant vs placebo in treating adults with insomnia disorder: a systematic review and meta-analysis of 1976 patients. [PDF]
Alsaied MA +6 more
europepmc +1 more source
On generic Kripke Structures (Model theoretic techniques for constructing infinite structures)
openaire
Quantitative Analysis of Lattice-valued Kripke Structures
To model and analyze systems with multi-valued information, in this paper, we present an extension of Kripke structures in the framework of complete residuted lattices, which we will refer to as lattice-valued Kripke structures (LKSs). We then show how the traditional trace containment and equivalence relations, can be lifted to the lattice-valued ...
PanHaiyu +3 more
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
DKL: an efficient algorithm for learning deterministic Kripke structures
Acta Informatica, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rabia Mazhar, Muddassar Azam Sindhu
openaire +3 more sources
Parameter Synthesis for Timed Kripke Structures
We show how to synthesise parameter values under which a given property, expressed in a certain extension of CTL, called RTCTLP, holds in a parametric timed Kripke structure. We prove the decidability of parameter synthesis for RTCTLP by showing how to restrict the infinite space of parameter valuations to its finite subset and employ a brute-force ...
MichaĆ Knapik, Wojciech Penczek
openalex +2 more sources
Logical Analysis of Multi-agent Kripke Structures
The last three decades witnessed a gradual shift from standalone-computer focused computations towards more and more distributed computational environment. This ever quickening shift brings new technological and theoretical challenges. Instead of seeing the computational system as completely controllable, which if malfunctioned should and can be ...
Sergey Babenyshev, Vladimir V. Rybakov
openalex +2 more sources
On the structure of kripke models of heyting arithmetic
Mathematical Logic Quarterly, 1993AbstractSince in Heyting Arithmetic (HA) all atomic formulas are decidable, a Kripke model for HA may be regarded classically as a collection of classical structures for the language of arithmetic, partially ordered by the submodel relation. The obvious question is then: are these classical structures models of Peano Arithmetic (PA)?
openaire +4 more sources

