cleanacc.cc 1.5 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
23
24
25
26
27
28
29
30
// -*- coding: utf-8 -*-
// Copyright (C) 2015 Laboratoire de Recherche et Développement
// 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/>.

#include "tgbaalgos/cleanacc.hh"

namespace spot
{
  void cleanup_acceptance(tgba_digraph_ptr& aut)
  {
    auto& acc = aut->acc();
    if (acc.num_sets() == 0)
      return;

    auto& c = aut->get_acceptance();
31
    acc_cond::mark_t used_in_cond = c.used_sets();
32
33
34
35
36
37
38
39
40
41
42
43
44
45

    acc_cond::mark_t used_in_aut = 0U;
    for (auto& t: aut->transitions())
      used_in_aut |= t.acc;

    auto useful = used_in_aut & used_in_cond;

    auto useless = acc.comp(useful);

    if (!useless)
      return;

    // Remove useless marks from the automaton
    for (auto& t: aut->transitions())
46
      t.acc = t.acc.strip(useless);
47
48

    // Remove useless marks from the acceptance condition
49
    aut->set_acceptance(useful.count(), c.strip(useless, true));
50
51
52
  }

}