libgsjj
1
Deterministic finite automata learning library
src
passive
Method.cpp
Go to the documentation of this file.
1
#include "
gsjj/passive/Method.h
"
2
3
#include "MapleCOMSPS_LRB/utils/System.h"
4
5
#include "
gsjj/passive/MethodFactory.h
"
6
7
#include "
gsjj/passive/SMT/BiermannMethod.h
"
8
#include "
gsjj/passive/SMT/NeiderJansenMethod.h
"
9
10
#include "
gsjj/passive/CNF/UnaryCNFMethod.h
"
11
#include "
gsjj/passive/CNF/BinaryCNFMethod.h
"
12
#include "
gsjj/passive/CNF/HeuleVerwerCNFMethod.h
"
13
14
#include "
gsjj/passive/NonCNF/UnaryNonCNFMethod.h
"
15
#include "
gsjj/passive/NonCNF/BinaryNonCNFMethod.h
"
16
#include "
gsjj/passive/NonCNF/HeuleVerwerNonCNFMethod.h
"
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
40
Method::~Method
() {
41
}
42
43
unsigned
int
Method::numberOfStates
()
const
{
44
return
m_numberStates
;
45
}
46
47
double
Method::timeToSolve
()
const
{
48
return
m_cpuTimeEnd
-
m_cpuTimeStart
;
49
}
50
}
51
}
gsjj
The namespace of the library.
Definition:
binary.h:11
gsjj::passive::Method::timeToSolve
double timeToSolve() const
Gives the CPU time taken to solve the problem.
Definition:
Method.cpp:47
gsjj::passive::Method::m_cpuTimeStart
double m_cpuTimeStart
Definition:
Method.h:126
MethodFactory.h
Method.h
gsjj::passive::Method::~Method
virtual ~Method()
Definition:
Method.cpp:40
HeuleVerwerNonCNFMethod.h
This file declares the Heule and Verwer method that relies on non CNF SAT solver. ...
NeiderJansenMethod.h
HeuleVerwerCNFMethod.h
This file declares the Heule and Verwer method that relies on CNF SAT solver.
UnaryNonCNFMethod.h
BinaryCNFMethod.h
This file declares the Biermann method that relies on a CNF SAT solver.
gsjj::passive::Method::numberOfStates
unsigned int numberOfStates() const
Gives the number of states of the prospected DFA (the n)
Definition:
Method.cpp:43
utils.h
gsjj::passive::Method::m_cpuTimeEnd
double m_cpuTimeEnd
Definition:
Method.h:127
BiermannMethod.h
gsjj::passive::Method::m_numberStates
const unsigned int m_numberStates
The number of states in the DFA to construct.
Definition:
Method.h:109
UnaryCNFMethod.h
Minisat
BinaryNonCNFMethod.h
Generated by
1.8.13