Results 11 to 20 of about 14,300 (195)
A Two Step Perspective for Kripke Structure Reduction [PDF]
, 2012 Accepted for Student Research Forum, 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013)
Arpit Sharma
openalex +3 more sources
Separable Kripke structures are algebraically universal [PDF]
Algebra Universalis, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science, 1988 A (finite) Kripke structure is a triple \(M=\), where S is the (finite) set of states, \(R\subseteq S\times S\) is a (total) transition relation and \({\mathcal L}\) is a valuation from states to the set of subsets of atomic formulas of a given (propositional) temporal logic theory \({\mathcal T}\). The chosen logics are \(CTL^*\) [\textit{E.
Browne, M.C. +2 more
openaire +4 more sources
Optimum satisfaction of CTL formulae for indeterminate labelled Kripke structures
, 2021 Model checking is an automatic technique for verifying whether the dynamics of a system satisfy the properties expressed in temporal logic. This is achieved by algorithmically verifying that a Kripke structure representation of system dynamics is a model of the temporal logic formula.
Michael Dixon
openalex +4 more sources
Deriving Kripke structures from time series segmentation results [PDF]
2008 9th International Workshop on Discrete Event Systems, 2008 Kripke structures are important modeling formalisms to understand the behavior of reactive systems. We present an approach to automatically infer Kripke structures from time series datasets. Our algorithm bridges the continuous world of time profiles and the discrete symbols of Kripke structures by incorporating a segmentation algorithm as an ...
Satish Tadepalli +4 more
openaire +3 more sources
Intuitionistic validity in T-normal Kripke structures
Annals of Pure and Applied Logic, 1993 Given any classical first-order theory \(T\), the author considers the set \({\mathcal H} T\) of all first-order sentences that are valid in every \(T\)- normal Kripke structure. A Kripke structure may be considered as a partially ordered set of classical structures and it is called \(T\)-normal iff each of these classical structures is a classical ...
openaire +3 more sources
A context dependent equivalence relation between Kripke structures [PDF]
, 1991 In [BCG87] Browne, Clarke and Grumberg define a bisimulation relation on Kripke structure and give a characterization of this equivalence relation in temporal logic. We will generalize their results to reactive systems, which are modelled by Kripke structures together with some constraints describing some requirements how the environment has to ...
B. Josko
openalex +2 more sources
A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic
COMPUTING AND INFORMATICS, 2009 We extend the usual notion of Kripke Structures with a weighted transition relation, and generalize the usual Boolean satisfaction relation of CTL to a map which assigns to states and temporal formulae a real-valued distance describing the degree of satisfaction.
Kim G. Larsen +2 more
openalex +7 more sources
Constrained Kripke structure for identifying parameters of biological models
Theoretical Computer SciencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean‐Paul Comet +4 more
openalex +2 more sources
Boolean full Kripke structures are alg-universal
, 2008 CMUC - Centro de Matemática da Universidade de Coimbra ...
M. Céu Pinto
openalex +3 more sources