spot  1.2.1a
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
union_scc.hh
1 // Copyright (C) 2013 Laboratoire de Recherche et Développement
2 // de l'Epita (LRDE).
3 //
4 // This file is part of Spot, a model checking library.
5 //
6 // Spot is free software; you can redistribute it and/or modify it
7 // under the terms of the GNU General Public License as published by
8 // the Free Software Foundation; either version 3 of the License, or
9 // (at your option) any later version.
10 //
11 // Spot is distributed in the hope that it will be useful, but WITHOUT
12 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
14 // License for more details.
15 //
16 // You should have received a copy of the GNU General Public License
17 // along with this program. If not, see <http://www.gnu.org/licenses/>.
18 
19 #ifndef SPOT_FASTTGBAALGOS_EC_UNION_SCC_HH
20 # define SPOT_FASTTGBAALGOS_EC_UNION_SCC_HH
21 
22 #include <stack>
23 #include <tuple>
24 #include "misc/hash.hh"
25 #include "union_find.hh"
26 #include "fasttgba/fasttgba.hh"
27 #include "ec.hh"
28 #include "root_stack.hh"
29 
30 namespace spot
31 {
32 
36  class SPOT_API union_scc : public ec
37  {
38  public:
39 
41  union_scc(instanciator* i, std::string otpion = "");
42 
44  virtual ~union_scc();
45 
47  bool check();
48 
50  std::string extra_info_csv();
51 
52  protected:
53 
55  inline void init();
56 
57  // ------------------------------------------------------------
58  // For classic algorithm with stack and UF
59  // ------------------------------------------------------------
60 
62  virtual void dfs_push(fasttgba_state*);
63 
65  virtual void dfs_pop();
66 
68  virtual bool merge(fasttgba_state*);
69 
71  virtual void main();
72 
75 
77  const fasttgba* a_;
78 
79  // An element in Todo stack
81  {
83  fasttgba_succ_iterator* lasttr;
84  };
85 
87  std::vector<pair_state_iter> todo;
88 
91 
94 
97 
98  markset* empty_;
99  unsigned int max_dfs_size_;
107  int K;
108  };
109 }
110 
111 #endif // SPOT_FASTTGBAALGOS_EC_UNION_SCC_HH
Definition: fasttgba.hh:33
int update_loop_cpt_
count UPDATE loop iterations
Definition: union_scc.hh:101
This class act as an interface for all classes.
Definition: fasttgba_state.hh:30
Abstract class for states.
Definition: state.hh:40
unsigned int max_dfs_size_
keep peack size
Definition: union_scc.hh:99
bool counterexample_found
the automaton that will be used for the Emptiness check
Definition: union_scc.hh:74
Definition: ec.hh:64
std::vector< pair_state_iter > todo
the todo stack
Definition: union_scc.hh:87
Definition: union_scc.hh:36
A simple wrapper for an automaton.
Definition: ec.hh:40
Definition: root_stack.hh:35
Iterate over the successors of a state.
Definition: fasttgba_succ_iterator.hh:35
int roots_poped_cpt_
count UPDATE loop iterations
Definition: union_scc.hh:102
int memory_cost_
evaluates memory
Definition: union_scc.hh:105
stack_of_roots * roots_stack_
Root of stack.
Definition: union_scc.hh:90
int transitions_cpt_
count transitions
Definition: union_scc.hh:104
Definition: union_scc.hh:80
union_find * uf
the union_find used for the storage
Definition: union_scc.hh:93
This class represents a set of acceptance marks.
Definition: markset.hh:35
int K
constant to evaluate cost
Definition: union_scc.hh:107
Definition: union_find.hh:46
const instance_automaton * inst
The instance automaton.
Definition: union_scc.hh:96
int trivial_scc_
count trivial SCCs
Definition: union_scc.hh:106
int states_cpt_
count states
Definition: union_scc.hh:103
Definition: ec.hh:28
int update_cpt_
count UPDATE calls
Definition: union_scc.hh:100

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Tue Jan 21 2014 16:52:01 for spot by doxygen 1.8.5