St-connectivity

Known as: STCON, ST Connectivity, STConnectivity 
In computer science and computational complexity theory, st-connectivity or STCON is a decision problem asking, for vertices s and t in a directed… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1995-2016
0519952016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We present <i>Universal Property Directed Reachability</i> (PDR<sup>&forall;</sup>), a property-directed semi-algorithm for… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
Is this relevant?
2014
2014
Current SAT-based Model Checking is based on two major approaches: Interpolation-based (Imc) (global, with unrollings) and… (More)
  • table 2
  • figure 1
Is this relevant?
2014
2014
In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via a polynomially uniform family… (More)
Is this relevant?
2014
2014
Property Directed Reachability (PDR) is a very promising recent method for deciding reachability in symbolically represented… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2013
2013
In 2011, property directed reachability (PDR) was proposed as an efficient algorithm to solve hardware model checking problems… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
The IC3 algorithm was recently introduced for proving properties of finite state reactive systems. It has been applied very… (More)
  • figure 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Last spring, in March 2010, Aaron Bradley published the first truly new bit-level symbolic model checking algorithm since Ken… (More)
  • figure 1
  • figure 2
  • figure 6
  • figure 5
  • figure 8
Is this relevant?
2007
2007
The factored state representation and concurrency semantics of Petri nets are closely related to those of concurrent planning… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1996
1996
On the complexity of the st-connectivity problem Chung Keung Poon Doctor of Philosophy 1996 Department of Computer Science… (More)
Is this relevant?
1995
1995
Directed st-connectivity is the problem of detecting whether or not there is a path from a distinguished node s to a… (More)
  • figure 1
Is this relevant?