minimize.cc 11 KB
Newer Older
1
// Copyright (C) 2010, 2011 Laboratoire de Recherche et Développement
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
// 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 <queue>
#include "minimize.hh"
#include "ltlast/allnodes.hh"
#include "misc/hash.hh"
25
26
#include "tgba/tgbaproduct.hh"
#include "tgba/tgbatba.hh"
27
#include "tgbaalgos/powerset.hh"
28
29
30
31
#include "tgbaalgos/gtec/gtec.hh"
#include "tgbaalgos/safety.hh"
#include "tgbaalgos/sccfilter.hh"
#include "tgbaalgos/ltl2tgba_fm.hh"
32
33
34
35
36
37
38
39
40
41
42
43

namespace spot
{
  typedef Sgi::hash_set<const state*,
                        state_ptr_hash, state_ptr_equal> hash_set;
  typedef Sgi::hash_map<const state*, unsigned,
                        state_ptr_hash, state_ptr_equal> hash_map;

  // Given an automaton a, find all states that are not in "final" and add
  // them to the set "non_final".
  void init_sets(const tgba_explicit* a,
                 hash_set& final,
44
                 hash_set& non_final)
45
46
  {
    hash_set seen;
Felix Abecassis's avatar
Felix Abecassis committed
47
    std::queue<const state*> tovisit;
48
    // Perform breadth-first traversal.
Felix Abecassis's avatar
Felix Abecassis committed
49
    const state* init = a->get_init_state();
50
51
52
53
    tovisit.push(init);
    seen.insert(init);
    while (!tovisit.empty())
    {
Felix Abecassis's avatar
Felix Abecassis committed
54
      const state* src = tovisit.front();
55
56
57
      tovisit.pop();
      // Is the state final ?
      if (final.find(src) == final.end())
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
58
59
	// No, add it to the set non_final
	non_final.insert(src->clone());
60
61
62
      tgba_succ_iterator* sit = a->succ_iter(src);
      for (sit->first(); !sit->done(); sit->next())
      {
Felix Abecassis's avatar
Felix Abecassis committed
63
        const state* dst = sit->current_state();
64
65
66
67
68
69
70
71
72
73
        // Is it a new state ?
        if (seen.find(dst) == seen.end())
        {
          // Register the successor for later processing.
          tovisit.push(dst);
          seen.insert(dst);
        }
        else
          delete dst;
      }
Felix Abecassis's avatar
Felix Abecassis committed
74
      delete sit;
75
    }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
76
77
78
79
80
81
82
83
84

    while (!seen.empty())
      {
	hash_set::iterator i = seen.begin();
	const state* s = *i;
	seen.erase(i);
	delete s;
      }

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
  }

  // From the base automaton and the list of sets, build the minimal
  // resulting automaton
  tgba_explicit_number* build_result(const tgba* a,
                                     std::list<hash_set*>& sets,
                                     hash_set* final)
  {
    // For each set, create a state in the resulting automaton.
    // For a state s, state_num[s] is the number of the state in the minimal
    // automaton.
    hash_map state_num;
    std::list<hash_set*>::iterator sit;
    unsigned num = 0;
    for (sit = sets.begin(); sit != sets.end(); ++sit)
    {
      hash_set::iterator hit;
      hash_set* h = *sit;
      for (hit = h->begin(); hit != h->end(); ++hit)
        state_num[*hit] = num;
      ++num;
    }
    typedef tgba_explicit_number::transition trs;
    tgba_explicit_number* res = new tgba_explicit_number(a->get_dict());
    // For each transition in the initial automaton, add the corresponding
    // transition in res.
111
112
    if (!final->empty())
      res->declare_acceptance_condition(ltl::constant::true_instance());
113
114
115
116
117
118
119
120
121
    for (sit = sets.begin(); sit != sets.end(); ++sit)
    {
      hash_set::iterator hit;
      hash_set* h = *sit;
      for (hit = h->begin(); hit != h->end(); ++hit)
      {
        const state* src = *hit;
        unsigned src_num = state_num[src];
        tgba_succ_iterator* succit = a->succ_iter(src);
Felix Abecassis's avatar
Felix Abecassis committed
122
        bool accepting = (final->find(src) != final->end());
123
124
        for (succit->first(); !succit->done(); succit->next())
        {
Felix Abecassis's avatar
Felix Abecassis committed
125
          const state* dst = succit->current_state();
126
          unsigned dst_num = state_num[dst];
Felix Abecassis's avatar
Felix Abecassis committed
127
          delete dst;
128
129
130
131
132
          trs* t = res->create_transition(src_num, dst_num);
          res->add_conditions(t, succit->current_condition());
          if (accepting)
            res->add_acceptance_condition(t, ltl::constant::true_instance());
        }
Felix Abecassis's avatar
Felix Abecassis committed
133
        delete succit;
134
135
136
137
138
      }
    }
    res->merge_transitions();
    const state* init_state = a->get_init_state();
    unsigned init_num = state_num[init_state];
Felix Abecassis's avatar
Felix Abecassis committed
139
    delete init_state;
140
141
142
143
    res->set_init_state(init_num);
    return res;
  }

144
  tgba_explicit* minimize(const tgba* a, bool monitor)
145
146
147
148
  {
    // The list of accepting states of a.
    std::list<const state*> acc_list;
    std::queue<hash_set*> todo;
Felix Abecassis's avatar
Felix Abecassis committed
149
    // The list of equivalent states.
150
    std::list<hash_set*> done;
151
    tgba_explicit* det_a = tgba_powerset(a, monitor ? 0 : &acc_list);
Felix Abecassis's avatar
Felix Abecassis committed
152
153
    hash_set* final = new hash_set;
    hash_set* non_final = new hash_set;
154
    hash_map state_set_map;
155
    bdd_dict* dict = det_a->get_dict();
156
157
    std::list<const state*>::iterator li;
    for (li = acc_list.begin(); li != acc_list.end(); ++li)
Felix Abecassis's avatar
Felix Abecassis committed
158
      final->insert(*li);
159
160

    init_sets(det_a, *final, *non_final);
161
162
    // Size of det_a
    unsigned size = final->size() + non_final->size();
163
164
165
166
167
168
169
170
171
    // Use bdd variables to number sets.  set_num is the first variable
    // available.
    unsigned set_num = dict->register_anonymous_variables(size, det_a);

    std::set<int> free_var;
    for (unsigned i = set_num; i < set_num + size; ++i)
      free_var.insert(i);
    std::map<int, int> used_var;

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
172
173
    hash_set* final_copy;

174
175
176
177
178
179
180
181
182
183
184
185
    if (!final->empty())
      {
	unsigned s = final->size();
	used_var[set_num] = s;
	free_var.erase(set_num);
	if (s > 1)
	  todo.push(final);
	else
	  done.push_back(final);
	for (hash_set::const_iterator i = final->begin();
	     i != final->end(); ++i)
	  state_set_map[*i] = set_num;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
186
187

	final_copy = new hash_set(*final);
188
      }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
189
190
191
192
193
    else
      {
	final_copy = final;
      }

194
195
196
197
198
199
200
201
202
203
204
205
206
207
    if (!non_final->empty())
      {
	unsigned s = non_final->size();
	unsigned num = set_num + 1;
	used_var[num] = s;
	free_var.erase(num);
	if (s > 1)
	  todo.push(non_final);
	else
	  done.push_back(non_final);
	for (hash_set::const_iterator i = non_final->begin();
	     i != non_final->end(); ++i)
	  state_set_map[*i] = num;
      }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
208
209
210
211
    else
      {
	delete non_final;
      }
212

213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
    // A bdd_states_map is a list of formulae (in a BDD form) associated with a
    // destination set of states.
    typedef std::list<std::pair<bdd, hash_set*> > bdd_states_map;
    // While we have unprocessed sets.
    while (!todo.empty())
    {
      // Get a set to process.
      hash_set* cur = todo.front();
      todo.pop();
      hash_set::iterator hi;
      bdd_states_map bdd_map;
      for (hi = cur->begin(); hi != cur->end(); ++hi)
      {
        const state* src = *hi;
        bdd f = bddfalse;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
228
        tgba_succ_iterator* si = det_a->succ_iter(src);
229
230
231
232
        for (si->first(); !si->done(); si->next())
        {
          const state* dst = si->current_state();
          unsigned dst_set = state_set_map[dst];
Felix Abecassis's avatar
Felix Abecassis committed
233
          delete dst;
234
          f |= (bdd_ithvar(dst_set) & si->current_condition());
235
        }
Felix Abecassis's avatar
Felix Abecassis committed
236
        delete si;
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
        bdd_states_map::iterator bsi;
        // Have we already seen this formula ?
        for (bsi = bdd_map.begin(); bsi != bdd_map.end() && bsi->first != f;
             ++bsi)
          continue;
        if (bsi == bdd_map.end())
        {
          // No, create a new set.
          hash_set* new_set = new hash_set;
          new_set->insert(src);
          bdd_map.push_back(std::make_pair<bdd, hash_set*>(f, new_set));
        }
        else
        {
          // Yes, add the current state to the set.
          hash_set* set = bsi->second;
          set->insert(src);
        }
      }
      bdd_states_map::iterator bsi = bdd_map.begin();
      // The set is minimal.
      if (bdd_map.size() == 1)
        done.push_back(bsi->second);
      else
      {
        for (; bsi != bdd_map.end(); ++bsi)
        {
          hash_set* set = bsi->second;
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
          // Free the number associated to these states.
	  unsigned num = state_set_map[*set->begin()];
	  assert(used_var.find(num) != used_var.end());
	  unsigned left = (used_var[num] -= set->size());
	  // Make sure LEFT does not become negative (hence bigger
	  // than SIZE when read as unsigned)
	  assert(left < size);
	  if (left == 0)
	    {
	      used_var.erase(num);
	      free_var.insert(num);
	    }
	  // Pick a free number
	  assert(!free_var.empty());
	  num = *free_var.begin();
	  free_var.erase(free_var.begin());
	  used_var[num] = set->size();
          for (hash_set::iterator hit = set->begin(); hit != set->end(); ++hit)
	    state_set_map[*hit] = num;
284
285
286
287
288
289
290
          // Trivial sets can't be splitted any further.
          if (set->size() == 1)
            done.push_back(set);
          else
            todo.push(set);
        }
      }
Felix Abecassis's avatar
Felix Abecassis committed
291
      delete cur;
292
    }
Felix Abecassis's avatar
Felix Abecassis committed
293
294
295
296
297
298
299
300
301
302
303
304
305
306

    // Build the result.
    tgba_explicit_number* res = build_result(det_a, done, final_copy);

    // Free all the allocated memory.
    delete final_copy;
    hash_map::iterator hit;
    for (hit = state_set_map.begin(); hit != state_set_map.end(); ++hit)
      delete hit->first;
    std::list<hash_set*>::iterator it;
    for (it = done.begin(); it != done.end(); ++it)
      delete *it;
    delete det_a;

307
308
    return res;
  }
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391

  const tgba*
  minimize_obligation(const tgba* aut_f,
		      const ltl::formula* f, const tgba* aut_neg_f)
  {
    // WDBA minimization
    tgba* min_aut_f = minimize(aut_f);

    // If aut_f is a safety automaton, the WDBA minimization must be
    // correct.
    if (is_safety_automaton(aut_f))
      {
	return min_aut_f;
      }

    if (!f && !aut_neg_f)
      {
	// We do not now if the minimization is safe.
	return 0;
      }

    const tgba* to_free = 0;

    // Build negation automaton if not supplied.
    if (!aut_neg_f)
      {
	assert(f);

	ltl::formula* neg_f = ltl::unop::instance(ltl::unop::Not, f->clone());
	aut_neg_f = ltl_to_tgba_fm(neg_f, aut_f->get_dict());
	neg_f->destroy();

	// Remove useless SCCs.
	const tgba* tmp = scc_filter(aut_neg_f, true);
	delete aut_neg_f;
	to_free = aut_neg_f = tmp;
      }

    // If the negation is a safety automaton, then the
    // minimization is correct.
    if (is_safety_automaton(aut_neg_f))
      {
	delete to_free;
	return min_aut_f;
      }

    bool ok = false;

    tgba* p = new tgba_product(min_aut_f, aut_neg_f);
    emptiness_check* ec = couvreur99(p);
    emptiness_check_result* res = ec->check();
    if (!res)
      {
	delete ec;
	delete p;
	tgba* min_aut_neg_f = minimize(aut_neg_f);
	tgba* p = new tgba_product(aut_f, min_aut_neg_f);
	emptiness_check* ec = couvreur99(p);
	res = ec->check();

	if (!res)
	  // Finally, we are now sure that it was safe
	  // to minimize the automaton.
	  ok = true;

	delete res;
	delete ec;
	delete p;
	delete min_aut_neg_f;
      }
    else
      {
	delete res;
	delete ec;
	delete p;
      }
    delete to_free;

    if (ok)
      return min_aut_f;
    delete min_aut_f;
    return aut_f;
  }
392
}