sccfilter.cc 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
// Copyright (C) 2009 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 "sccfilter.hh"
#include "tgba/tgbaexplicit.hh"
#include "reachiter.hh"
#include "tgbaalgos/scc.hh"
#include <sstream>

namespace spot
{
  namespace
  {
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
    static
    tgba_explicit::transition*
    create_transition(const tgba* aut, tgba_explicit_string* out_aut,
		      const state* in_s, int in,
		      const state* out_s, int out)
    {
      std::ostringstream in_name;
      in_name << "(#" << in << ") " << aut->format_state(in_s);
      std::ostringstream out_name;
      out_name << "(#" << out << ") " << aut->format_state(out_s);
      return out_aut->create_transition(in_name.str(), out_name.str());
    }

    static
    tgba_explicit::transition*
    create_transition(const tgba* aut, tgba_explicit_formula* out_aut,
		      const state* in_s, int, const state* out_s, int)
    {
      const tgba_explicit_formula* a =
	static_cast<const tgba_explicit_formula*>(aut);
      const ltl::formula* in_f = a->get_label(in_s);
      const ltl::formula* out_f = a->get_label(out_s);
      if (!out_aut->has_state(in_f))
	in_f->clone();
      if (!out_aut->has_state(out_f))
	out_f->clone();
      return out_aut->create_transition(in_f, out_f);
    }

    template<class T>
61
62
63
64
65
    class filter_iter: public tgba_reachable_iterator_depth_first
    {
    public:
      filter_iter(const tgba* a,
		  const scc_map& sm,
66
67
		  const std::vector<bool>& useless,
		  bdd useful, bdd strip)
68
	: tgba_reachable_iterator_depth_first(a),
69
	  out_(new T(a->get_dict())),
70
	  sm_(sm),
71
72
73
	  useless_(useless),
	  useful_(useful),
	  strip_(strip)
74
      {
75
	out_->set_acceptance_conditions(useful);
76
77
      }

78
      T*
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
      result()
      {
	return out_;
      }

      bool
      want_state(const state* s) const
      {
	return !useless_[sm_.scc_of_state(s)];
      }

      void
      process_link(const state* in_s, int in,
		   const state* out_s, int out,
		   const tgba_succ_iterator* si)
      {
	tgba_explicit::transition* t =
96
	  create_transition(this->automata_, out_, in_s, in, out_s, out);
97
98
99
100
101
102
	out_->add_conditions(t, si->current_condition());

	// Do not output any acceptance condition if either the source or
	// the destination state do not belong to an accepting state.
	if (sm_.accepting(sm_.scc_of_state(in_s))
	    && sm_.accepting(sm_.scc_of_state(out_s)))
103
104
105
	  out_->add_acceptance_conditions
	    (t, (bdd_exist(si->current_acceptance_conditions(), strip_)
		 & useful_));
106
107
108
      }

    private:
109
      T* out_;
110
111
      const scc_map& sm_;
      const std::vector<bool>& useless_;
112
113
      bdd useful_;
      bdd strip_;
114
    };
115

116
117
118
119
120
121
122
123
124
  } // anonymous


  tgba* scc_filter(const tgba* aut)
  {
    scc_map sm(aut);
    sm.build_map();
    scc_stats ss = build_scc_stats(sm);

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
    bdd useful = ss.useful_acc;
    if (useful == bddfalse)
      // Even if no acceptance conditions are useful in a SCC,
      // we need to keep at least one acceptance conditions
      useful = bdd_satone(aut->all_acceptance_conditions());

    bdd positive = bddtrue;
    bdd cur = useful;
    while (cur != bddfalse)
      {
	bdd a = bdd_satone(cur);
	cur -= a;
	for (;;)
	  {
	    if (bdd_low(a) == bddfalse)
	      {
		positive &= bdd_ithvar(bdd_var(a));
		break;
	      }
	    a = bdd_low(a);
	  }
      }

    bdd strip = bdd_exist(bdd_support(aut->all_acceptance_conditions()),
			  positive);
    useful = bdd_exist(useful, strip);
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

    // In most cases we will create a tgba_explicit_string copy of the
    // initial tgba, but this is not very space efficient as the
    // labels are built using the "format_state()" string output of
    // the original automaton.  In the case where the source automaton is
    // a tgba_explicit_formula (typically after calling ltl2tgba_fm())
    // we can create another tgba_explicit_formula instead.
    const tgba_explicit_formula* af =
      dynamic_cast<const tgba_explicit_formula*>(aut);
    if (af)
      {
	filter_iter<tgba_explicit_formula> fi(af, sm, ss.useless_scc_map,
					     useful, strip);
	fi.run();
	tgba_explicit_formula* res = fi.result();
	res->merge_transitions();
	return res;
      }
    else
      {
	filter_iter<tgba_explicit_string> fi(aut, sm, ss.useless_scc_map,
					      useful, strip);
	fi.run();
	tgba_explicit_string* res = fi.result();
	res->merge_transitions();
	return res;
      }
178
179
180
181
182
  }



}