strength.cc 6.08 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
3
// Copyright (C) 2010, 2011, 2013, 2014, 2015 Laboratoire de Recherche
// et Développement de l'Epita (LRDE)
4
5
6
7
8
//
// 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
9
// the Free Software Foundation; either version 3 of the License, or
10
11
12
13
14
15
16
17
// (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
18
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
19

20
21
22
23
#include <spot/twaalgos/strength.hh>
#include <spot/misc/hash.hh>
#include <spot/twaalgos/isweakscc.hh>
#include <spot/twaalgos/mask.hh>
24
#include <deque>
25
26
27

namespace spot
{
28
  namespace
29
  {
30
31
    template <bool terminal, bool set = false>
    bool is_type_automaton(const twa_graph_ptr& aut, scc_info* si)
32
33
34
35
36
37
    {
      // Create an scc_info if the user did not give one to us.
      bool need_si = !si;
      if (need_si)
	si = new scc_info(aut);
      si->determine_unknown_acceptance();
38

39
40
      bool is_weak = true;
      bool is_term = true;
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
      unsigned n = si->scc_count();
      for (unsigned i = 0; i < n; ++i)
	{
	  if (si->is_trivial(i))
	    continue;
	  bool first = true;
	  acc_cond::mark_t m = 0U;
	  for (auto src: si->states_of(i))
	    for (auto& t: aut->out(src))
	      if (si->scc_of(t.dst) == i)
		{
		  if (first)
		    {
		      first = false;
		      m = t.acc;
		    }
		  else if (m != t.acc)
		    {
59
		      is_weak = false;
60
61
62
63
64
		      goto exit;
		    }
		}
	  if (terminal && si->is_accepting_scc(i) && !is_complete_scc(*si, i))
	    {
65
66
67
	      is_term = false;
	      if (!set)
		break;
68
69
70
71
72
	    }
	}
    exit:
      if (need_si)
	delete si;
73
74
75
76
77
78
79
      if (set)
	{
	  if (terminal)
	    aut->prop_terminal(is_term && is_weak);
	  aut->prop_weak(is_weak);
	}
      return is_weak && is_term;
80
81
    }
  }
82

83
84
85
  bool
  is_terminal_automaton(const const_twa_graph_ptr& aut, scc_info* si)
  {
86
87
88
    return (aut->prop_terminal() ||
	    is_type_automaton<true>(std::const_pointer_cast<twa_graph>(aut),
				    si));
89
  }
90

91
92
93
  bool
  is_weak_automaton(const const_twa_graph_ptr& aut, scc_info* si)
  {
94
95
96
97
98
99
100
101
    return (aut->prop_weak() ||
	    is_type_automaton<false>(std::const_pointer_cast<twa_graph>(aut),
				     si));
  }

  void check_strength(const twa_graph_ptr& aut, scc_info* si)
  {
    is_type_automaton<true, true>(aut, si);
102
103
  }

104
  bool is_safety_mwdba(const const_twa_graph_ptr& aut)
105
  {
106
    if (!(aut->acc().is_buchi() || aut->acc().is_tt()))
107
108
109
      throw std::runtime_error
	("is_safety_mwdba() should be called on a Buchi automaton");

110
    for (auto& t: aut->edges())
111
112
      if (!aut->acc().accepting(t.acc))
	return false;
113
    return true;
114
  }
115
116


117
118
119
120
121
122
123
124
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
  twa_graph_ptr
  decompose_strength(const const_twa_graph_ptr& aut, const char* keep_opt)
  {
    if (keep_opt == nullptr || *keep_opt == 0)
      throw std::runtime_error
	(std::string("option for decompose_strength() should not be empty"));

    enum strength {
      Ignore = 0,
      Terminal = 1,
      WeakStrict = 2,
      Weak = Terminal | WeakStrict,
      Strong = 4,
      Needed = 8,		// Needed SCCs are those that lead to
				// the SCCs we want to keep.
    };
    unsigned char keep = Ignore;
    while (auto c = *keep_opt++)
      switch (c)
	{
	case 's':
	  keep |= Strong;
	  break;
	case 't':
	  keep |= Terminal;
	  break;
	case 'w':
	  keep |= WeakStrict;
	  break;
	default:
	  throw std::runtime_error
	    (std::string("unknown option for decompose_strength(): ") + c);
	}

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
    acc_cond::mark_t wacc = 0U;	// Acceptance for weak SCCs
    acc_cond::mark_t uacc = 0U;	// Acceptance for "needed" SCCs, that
				// we only want to traverse.

    // If the acceptance condition is always satisfiable, we will
    // consider the automaton has weak (even if that is not the
    // case syntactically) and not output any strong part.
    bool all_accepting = false;
    if (aut->acc().is_tt())
      {
	all_accepting = true;
      }
    else if (aut->acc().uses_fin_acceptance())
      {
	auto p = aut->get_acceptance().unsat_mark();
	if (p.first)
	  uacc = p.second;
	else
	  all_accepting = true;
      }
    if (all_accepting)
      {
	keep &= ~Strong;
	if (keep == Ignore)
	  return nullptr;
      }

178
179
180
181
182
183
184
185
186
187
188
189
    scc_info si(aut);
    si.determine_unknown_acceptance();

    unsigned n = si.scc_count();
    std::vector<unsigned char> want(n, Ignore);
    bool nonempty = false;
    bool strong_seen = false;

    for (unsigned i = 0; i < n; ++i) // SCC are topologically ordered
      {
	if (si.is_accepting_scc(i))
	  {
190
	    if (all_accepting | is_weak_scc(si, i))
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
	      {
		if (keep & Weak)
		  {
		    if ((keep & Weak) == Weak)
		      want[i] = Weak;
		    else
		      want[i] = keep &
			(is_complete_scc(si, i) ? Terminal : WeakStrict);
		  }
	      }
	    else
	      {
		want[i] = keep & Strong;
		strong_seen = true;
	      }
	    nonempty |= want[i];
	  }
	// An SCC is needed if one of its successor is.
	for (unsigned j: si.succ(i))
	  if (want[j])
	    {
	      want[i] |= Needed;
	      break;
	    }
      }

    if (!nonempty)
      return nullptr;

    twa_graph_ptr res = make_twa_graph(aut->get_dict());
    res->copy_ap_of(aut);
    res->prop_copy(aut, { true, false, true, false });
223

224
    if (keep & Strong)
225
      res->copy_acceptance_of(aut);
226
    else
227
      wacc = res->set_buchi();
228
229
230
231
232
233
234
235
236
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

    auto fun = [&si, &want, uacc, wacc, keep]
      (unsigned src, bdd& cond, acc_cond::mark_t& acc, unsigned dst)
      {
	if (want[si.scc_of(dst)] == Ignore)
	  {
	    cond = bddfalse;
	    return;
	  }
	if (want[si.scc_of(src)] == Needed)
	  {
	    acc = uacc;
	    return;
	  }
	if (keep & Strong)
	  return;
	acc = wacc;
      };

    transform_accessible(aut, res, fun);

    if (!(keep & Strong))
      {
	res->prop_weak(true);
	if (!(keep & WeakStrict))
	  {
	    assert(keep & Terminal);
	    res->prop_terminal(true);
	  }
      }
    else
      {
	res->prop_weak(!strong_seen);
      }
    return res;
  }
264
}