UnCoVer (Using Coverability for Verification)
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Pages
LEQCheckScenario.h
1 /***************************************************************************
2  * Copyright (C) 2015 by Jan Stückrath <jan.stueckrath@uni-due.de> *
3  * *
4  * This program is free software; you can redistribute it and/or modify *
5  * it under the terms of the GNU General Public License as published by *
6  * the Free Software Foundation; either version 2 of the License, or *
7  * (at your option) any later version. *
8  * *
9  * This program is distributed in the hope that it will be useful, *
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
12  * GNU General Public License for more details. *
13  * *
14  * You should have received a copy of the GNU General Public License *
15  * along with this program; if not, write to the *
16  * Free Software Foundation, Inc., *
17  * 51 Franklin St, Fifth Floor, Boston, MA 02110, USA *
18  ***************************************************************************/
19 
20 #ifndef LEQCHECKSCENARIO_H_
21 #define LEQCHECKSCENARIO_H_
22 
23 #include "../basic_types/Scenario.h"
24 #include "../graphs/Hypergraph.h"
25 #include "../basic_types/Order.h"
26 
27 namespace uncover {
28  namespace scenarios {
29 
42 
43  public:
44 
49 
53  virtual ~LEQCheckScenario();
54 
55  // Overwriting
56  virtual void run() override;
57 
58  // Overwriting
59  virtual void initialize(unordered_map<string,string>& parameters) override;
60 
61  private:
62 
66  bool faststop;
67 
72 
76  shared_ptr<vector<graphs::Hypergraph_sp>> minimalGraphs;
77 
81  shared_ptr<vector<graphs::Hypergraph_sp>> checkGraphs;
82 
83  };
84 
85  } /* namespace scenarios */
86 } /* namespace uncover */
87 
88 #endif /* LEQCHECKSCENARIO_H_ */
shared_ptr< vector< graphs::Hypergraph_sp > > checkGraphs
Stores the set of graphs for which it will be checked if they are represented by a graph of minimalGr...
Definition: LEQCheckScenario.h:81
LEQCheckScenario()
Creates a new LEQCheckScenario without initializing it.
Definition: LEQCheckScenario.cpp:39
virtual void run() override
Executes the scenario.
Definition: LEQCheckScenario.cpp:119
shared_ptr< vector< graphs::Hypergraph_sp > > minimalGraphs
Stores the set of minimal graphs of an upward closed set.
Definition: LEQCheckScenario.h:76
bool faststop
Stores whether this Scenario should terminate after the first related pair of graphs was found...
Definition: LEQCheckScenario.h:66
basic_types::Order * order
Stores the Order used by this Scenario.
Definition: LEQCheckScenario.h:71
virtual void initialize(unordered_map< string, string > &parameters) override
Initializes the scenario with the given mapping, where the keys are parameter names.
Definition: LEQCheckScenario.cpp:69
This Scenario allows to check whether graphs of a given set are represented by another given...
Definition: LEQCheckScenario.h:41
A scenario is a subprogram using a set of input parameters to execute some algorithms, producing desired output.
Definition: Scenario.h:36
This class presents a generic ordering relation on Hypergraphs.
Definition: Order.h:32
virtual ~LEQCheckScenario()
Destroys this instance of LEQCheckScenario.
Definition: LEQCheckScenario.cpp:65