kripkeexplicit.cc 6.63 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
// Copyright (C) 2011 Laboratoire de Recherche et Developpement
// de l'Epita (LRDE)
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// Spot is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Spot; see the file COPYING.  If not, write to the Free
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
// 02111-1307, USA.


#include "kripkeexplicit.hh"
23
#include "tgba/bddprint.hh"
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
#include "tgba/formula2bdd.hh"
#include <iostream>

namespace spot
{

  state_kripke::state_kripke()
    : bdd_ (bddtrue)
  {
  }

  void state_kripke::add_conditions(bdd f)
  {
    bdd_ &= f;
  }

  void state_kripke::add_succ(state_kripke* add_me)
  {
    // This method must add only state_kripke for now.
    state_kripke* to_add = down_cast<state_kripke*>(add_me);
    assert(to_add);
    succ_.push_back(to_add);
  }

  int state_kripke::compare(const state* other) const
  {
    // This method should not be called to compare states from different
    // automata, and all states from the same automaton will use the same
    // state class.
    const state_kripke* s = down_cast<const state_kripke*>(other);
    assert(s);
    return s - this;
  }

  size_t
  state_kripke::hash() const
  {
    return
    reinterpret_cast<const char*>(this) - static_cast<const char*>(0);
  }

  state_kripke*
  state_kripke::clone() const
  {
    return const_cast<state_kripke*>(this);
  }

  ////////////////////////////
  // Support for succ_iterator

  const std::list<state_kripke*>&
  state_kripke::get_succ() const
  {
    return succ_;
  }









  /////////////////////////////////////
  // kripke_explicit_succ_iterator

  kripke_explicit_succ_iterator::kripke_explicit_succ_iterator
  (const state_kripke* s, bdd cond)
    : kripke_succ_iterator(cond),
      s_(s)
  {
  }


  kripke_explicit_succ_iterator::~kripke_explicit_succ_iterator()
  {
  }

  void kripke_explicit_succ_iterator::first()
  {
    it_ = s_->get_succ().begin();
  }

  void kripke_explicit_succ_iterator::next()
  {
    ++it_;
  }

  bool kripke_explicit_succ_iterator::done() const
  {
    return it_ == s_->get_succ().end();
  }

  state_kripke* kripke_explicit_succ_iterator::current_state() const
  {
    assert(!done());
    return *it_;
  }

  /////////////////////////////////////
  // kripke_explicit


  kripke_explicit::kripke_explicit(bdd_dict* dict)
    : dict_(dict),
      init_(0)
  {
  }

  kripke_explicit::kripke_explicit(bdd_dict* dict,
                                   state_kripke*  init)
    : dict_(dict),
      init_ (init)
  {
  }


  std::string
  kripke_explicit::format_state(const spot::state* s) const
  {
    assert(s);
    const state_kripke* se = down_cast<const state_kripke*>(s);
    assert(se);
    std::map<const state_kripke*, std::string>::const_iterator it =
      sn_nodes_.find (se);
    assert(it != sn_nodes_.end());
    return it->second;
  }

  kripke_explicit::~kripke_explicit()
  {
    dict_->unregister_all_my_variables(this);
    std::map<const std::string, state_kripke*>::iterator it;
    for (it = ns_nodes_.begin(); it != ns_nodes_.end(); it++)
    {
      state_kripke* del_me = it->second;
      delete del_me;
    }
  }

  state_kripke*
  kripke_explicit::get_init_state() const
  {
    return init_;
  }

  bdd_dict*
  kripke_explicit::get_dict() const
  {
    return dict_;
  }

  // FIXME : Change the bddtrue.
  kripke_explicit_succ_iterator*
  kripke_explicit::succ_iter(const spot::state* local_state,
                            const spot::state* global_state,
                            const tgba* global_automaton) const
  {
    const state_kripke* s = down_cast<const state_kripke*>(local_state);
    assert(s);
    (void) global_state;
    (void) global_automaton;
    state_kripke* it = const_cast<state_kripke*>(s);
    return new kripke_explicit_succ_iterator(it, bddtrue);
  }

  bdd
  kripke_explicit::state_condition(const state* s) const
  {
    const state_kripke* f = down_cast<const state_kripke*>(s);
    assert(f);
    return (f->as_bdd());
  }

  bdd
  kripke_explicit::state_condition(const std::string name) const
  {
    std::map<const std::string, state_kripke*>::const_iterator it;
    it = ns_nodes_.find(name);
    assert(it != ns_nodes_.end());
    return state_condition(it->second);
  }

  const std::map<const state_kripke*, std::string>&
  kripke_explicit::sn_get() const
  {
    return sn_nodes_;
  }


  void kripke_explicit::add_state(std::string name,
                                 state_kripke* state)
  {
    if (ns_nodes_.find(name) == ns_nodes_.end())
    {
      ns_nodes_[name] = state;
      sn_nodes_[state] = name;
      if (!init_)
        init_ = state;
    }
  }

  void kripke_explicit::add_state(std::string name)
  {
    if (ns_nodes_.find(name) == ns_nodes_.end())
    {
      state_kripke* state = new state_kripke;
      add_state(name, state);
    }
  }

  void kripke_explicit::add_transition(state_kripke* source,
                                       const state_kripke* dest)
  {
    state_kripke* Dest = const_cast<state_kripke*>(dest);
    source->add_succ(Dest);
  }

  void kripke_explicit::add_transition(std::string source,
                                       const state_kripke* dest)
  {
    add_transition(ns_nodes_[source], dest);
  }

  void kripke_explicit::add_transition(std::string source,
                                       std::string dest)
  {
    state_kripke* neo = 0;
    std::map<std::string, state_kripke*>::iterator destination
      = ns_nodes_.find(dest);

    if (ns_nodes_.find(dest) == ns_nodes_.end())
    {
      neo = new state_kripke;
      add_state(dest, neo);
      add_transition(source, neo);
    }
    else
    {
      add_transition(source, destination->second);
    }
  }

  void kripke_explicit::add_conditions(bdd add,
                                       state_kripke* on_me)
  {
    on_me->add_conditions(add);
  }

  void kripke_explicit::add_conditions(bdd add,
                                       std::string on_me)
  {
    add_conditions(add, ns_nodes_[on_me]);
  }


  void kripke_explicit::add_condition(const ltl::formula* f,
                                      std::string on_me)
  {
    add_conditions(formula_to_bdd(f, dict_, this), on_me);
    f->destroy();
  }


} // End namespace spot.