State space enumeration

In computer science, state space enumeration are methods that consider each reachable program state to determine whether a program satisfies a given… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
An earlier work of ours has proposed a novel approach for the deployment of the maximally permissive deadlock avoidance policy… (More)
  • table I
  • table III
  • table II
  • figure 1
  • table IV
Is this relevant?
2013
2013
Resilient network design has become a prominent research topic in the wake of recent disasters in Japan and the United States… (More)
  • figure 1
  • figure 3
  • figure 2
  • table I
  • figure 4
Is this relevant?
2013
2013
This paper presents a practical method and associated tool for verifying deadlock freedom properties in guarded command systems… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2008
2008
We describe a methodology that embeds the theory of preemptive Time Petri Nets (pTPN) along development and verification… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
This paper presents a method of partial automation of specification based regression testing, which we call ESSE (Explicit State… (More)
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2004
2004
The sequential circuit state space diameter problem is an important proble m in sequential verification. Bounded model checking… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Formal methods based on state-space enumeration, such as timed automata and time Petri nets (TPN), have been proposed for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
This work proposes a technique to automatically obtain timing constraints for a given timed circuit to operate correctly. A… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP… (More)
Is this relevant?
1998
1998
This paper presents an approach to verifying timed designs based on reenement: rst, correctness is established for a speed… (More)
  • figure 2
  • figure 3
  • figure 8
Is this relevant?