complete.cc 3.05 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
// 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 "complete.hh"
21
#include "dupexp.hh"
22
23
24

namespace spot
{
25
  unsigned tgba_complete_here(tgba_digraph* aut)
26
  {
27
28
29
30
    unsigned n = aut->num_states();
    unsigned sink = -1U;
    bdd allacc = aut->all_acceptance_conditions();
    if (allacc == bddfalse)
31
      {
32
33
34
	// We cannot safely complete an automaton if it has no
	// acceptance set as the added sink would become accepting.
	// In this case, add an acceptance set to all transitions.
35
	allacc = aut->set_single_acceptance_set();
36
37
	for (auto& t: aut->transitions())
	  t.acc = allacc;
38
      }
39
    else
40
      {
41
42
43
44
	// If some acceptance sets were used, loop over the states and
	// seek a state that has only self loops, and that is not
	// accepting.  This will be our sink state.
	for (unsigned i = 0; i < n; ++i)
45
	  {
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
	    bool selfloop = true;
	    bdd accsum = bddfalse;
	    for (auto& t: aut->out(i))
	      {
		if (t.dst != i)	// Not a self-loop
		  {
		    selfloop = false;
		    break;
		  }
		accsum |= t.acc;
	      }
	    if (selfloop && accsum != allacc) // We have found a sink!
	      {
		sink = i;
		break;
	      }
62
63
	  }
      }
64
65
66
67
68
69
    // If we haven't found any sink, simply add one.
    if (sink == -1U)
      {
	sink = aut->new_state();
	++n;
      }
70

71
72
    // Now complete all states (including the sink).
    for (unsigned i = 0; i < n; ++i)
73
      {
74
	bdd missingcond = bddtrue;
75
	bdd acc = bddfalse;
76
	for (auto& t: aut->out(i))
77
	  {
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
	    missingcond -= t.cond;
	    // FIXME: This is ugly.
	    //
	    // In case the automaton uses state-based acceptance, we
	    // need to put the new transition in the same set as all
	    // the other.
	    //
	    // In case the automaton uses transition-based acceptance,
	    // it does not matter what acceptance set we put the new
	    // transition into.
	    //
	    // So in both cases, we put the transition in the same
	    // acceptance sets as the last outgoing transition of the
	    // state.
	    acc = t.acc;
93
	  }
94
95
96
97
	// In case the automaton use state-based acceptance, propagate
	// the acceptance of the first transition to the one we add.
	if (missingcond != bddfalse)
	  aut->new_transition(i, sink, missingcond, acc);
98
      }
99
100
    return sink;
  }
101

102
  tgba_digraph* tgba_complete(const tgba* aut)
103
  {
104
105
106
    tgba_digraph* res = tgba_dupexp_dfs(aut);
    tgba_complete_here(res);
    return res;
107
108
  }

109
}