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

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… Expand
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… Expand
  • 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… Expand
  • figure 1
  • figure 3
  • figure 2
  • table I
  • figure 4
Is this relevant?
2011
2011
Hierarchical Scheduling (HS) systems manage a set of realtime applications through a scheduling hierarchy, enabling partitioning… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
2008
2008
We describe a methodology that embeds the theory of preemptive Time Petri Nets (pTPN) along development and verification… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
This thesis presents a software implementation that provides an application-independent method for searching and enumerating… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
2007
2007
We address the problem of test case selection and path sensitization in the process of testing real-time preemptive systems… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
This paper presents a method of partial automation of specification based regression testing, which we call ESSE (Explicit State… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
2004
2004
The sequential circuit state space diameter problem is an important problem in sequential verification. Bounded model checking is… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
Presents a class of Petri nets called process nets with resources (PNRs) for modeling manufacturing systems where only parts can… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?