libgsjj  1
Deterministic finite automata learning library
Method.cpp
Go to the documentation of this file.
1 #include "gsjj/passive/Method.h"
2 
3 #include "MapleCOMSPS_LRB/utils/System.h"
4 
6 
9 
13 
17 
18 #include "gsjj/passive/utils.h"
19 
20 using namespace Minisat;
21 
22 namespace gsjj {
23  namespace passive {
24 
25  Method::Method(const std::set<std::string> &SpSet, const std::set<std::string> &SmSet, const std::set<std::string> &SSet, const std::set<std::string> &prefixesSet, const std::set<char> &alphabetSet, unsigned int n) :
26  m_Sp(SpSet),
27  m_Sm(SmSet),
28  m_numberStates(n),
29  m_S(SSet),
30  m_prefixes(prefixesSet),
31  m_alphabet(alphabetSet),
32  m_triedSolve(false),
33  m_hasSolution(false),
34  m_cpuTimeStart(0),
35  m_cpuTimeEnd(0)
36  {
37 
38  }
39 
41  }
42 
43  unsigned int Method::numberOfStates() const {
44  return m_numberStates;
45  }
46 
47  double Method::timeToSolve() const {
49  }
50  }
51 }
The namespace of the library.
Definition: binary.h:11
double timeToSolve() const
Gives the CPU time taken to solve the problem.
Definition: Method.cpp:47
double m_cpuTimeStart
Definition: Method.h:126
virtual ~Method()
Definition: Method.cpp:40
This file declares the Heule and Verwer method that relies on non CNF SAT solver. ...
This file declares the Heule and Verwer method that relies on CNF SAT solver.
This file declares the Biermann method that relies on a CNF SAT solver.
unsigned int numberOfStates() const
Gives the number of states of the prospected DFA (the n)
Definition: Method.cpp:43
const unsigned int m_numberStates
The number of states in the DFA to construct.
Definition: Method.h:109