cleanacc.cc 2.35 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2015, 2017 Laboratoire de Recherche et Développement
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// de l'Epita.
//
// 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 3 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 this program.  If not, see <http://www.gnu.org/licenses/>.

20
#include <spot/twaalgos/cleanacc.hh>
21
22
23

namespace spot
{
24
  twa_graph_ptr cleanup_acceptance_here(twa_graph_ptr aut, bool strip)
25
26
27
  {
    auto& acc = aut->acc();
    if (acc.num_sets() == 0)
28
      return aut;
29

30
    auto c = aut->get_acceptance();
31
    acc_cond::mark_t used_in_cond = c.used_sets();
32
33

    acc_cond::mark_t used_in_aut = 0U;
34
    acc_cond::mark_t used_on_all_edges = used_in_cond;
35
    for (auto& t: aut->edges())
36
37
38
39
      {
        used_in_aut |= t.acc;
        used_on_all_edges &= t.acc;
      }
40
41

    auto useful = used_in_aut & used_in_cond;
42
    auto useless = strip ? acc.comp(useful) : (used_in_cond - used_in_aut);
43

44
    useless |= used_on_all_edges;
45
46

    if (!useless)
47
      return aut;
48
49

    // Remove useless marks from the automaton
50
51
52
53
54
55
56
57
    if (strip)
      for (auto& t: aut->edges())
        t.acc = t.acc.strip(useless);

    // if x appears on all edges, then
    //   Fin(x) = false and Inf(x) = true
    if (used_on_all_edges)
      c = c.remove(used_on_all_edges, false);
58
59

    // Remove useless marks from the acceptance condition
60
61
62
63
    if (strip)
      aut->set_acceptance(useful.count(), c.strip(useless, true));
    else
      aut->set_acceptance(aut->num_sets(), c.remove(useless, true));
64
65

    // This may in turn cause even more set to be unused, because of
66
67
    // some simplifications in the acceptance condition, so do it again.
    return cleanup_acceptance_here(aut, strip);
68
69
  }

70
  twa_graph_ptr cleanup_acceptance(const_twa_graph_ptr aut)
71
  {
72
    return cleanup_acceptance_here(make_twa_graph(aut,
73
                                                     twa::prop_set::all()));
74
75
76
  }


77
}