Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Kripke structure (model checking)

Known as: Kripke Structure, Kripke structures 
A Kripke structure is a variation of the transition system, originally proposed by Saul Kripke, used in model checking to represent the behavior of a… Expand
Wikipedia

Related topics

Related topics

11 relations
Computation tree logicDeadlockGraph (discrete mathematics)Kripke semantics
Expand

Broader (2)

Model checkingTemporal logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
Multi-valued symbolic model-checking
This article introduces the concept of multi-valued model-checking and describes a multi-valued symbolic model-checker, ΧChek… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Model Checking a Path (Preliminary Report)
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Basic Propositional Calculus I
We present an axiomatization for Basic Propositional Calculus BPC and give a completeness theorem for the class of transitive… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Abstract interpretation of reactive systems
The advent of ever more complex reactive systems in increasingly critical areas calls for the development of automated verication… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic
Abstract A well-known result of Ladner says that the satisfiability problem for K45, KD45, and S5 is NP-complete. This result… Expand
  • table 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Model checking, abstraction, and compositional verification
Because of the difficulty of adequately simulating large digital designs, there has been a recent surge of interest in formal… Expand
  • figure 2.7
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Characterizing Finite Kripke Structures in Propositional Temporal Logic
Abstract We show that if two finite Kripke structures can be distinguished by some CTL ∗ formula that contains both branching… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Modalities for Model Checking: Branching Time Logic Strikes Back
Abstract We consider automatic verification of finite state concurrent programs. The global state graph of such a program can be… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Kripke-Style Models for Typed lambda Calculus
The semantics of typed lambda calculus is usually described using Henkin models, consisting of functions over some collection of… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Improved upper and lower bounds for modal logics of programs
We describe novel techniques for establishing improved upper and lower bounds for modal logics of programs: 1) We introduce… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE