sbacc.cc 2.13 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
31
32
33
// -*- 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 <vector>
#include <map>
#include <utility>
#include "sbacc.hh"

namespace spot
{
  tgba_digraph_ptr sbacc(tgba_digraph_ptr& old)
  {
    if (old->has_state_based_acc())
      return old;

    auto res = make_tgba_digraph(old->get_dict());
    res->copy_ap_of(old);
34
    res->copy_acceptance_of(old);
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79

    typedef std::pair<unsigned, acc_cond::mark_t> pair_t;
    std::map<pair_t, unsigned> s2n;

    std::vector<std::pair<pair_t, unsigned>> todo;

    auto new_state =
      [&](unsigned state, acc_cond::mark_t m) -> unsigned
      {
	pair_t x(state, m);
	auto p = s2n.emplace(x, 0);
	if (p.second)		// This is a new state
	  {
	    unsigned s = res->new_state();
	    p.first->second = s;
	    todo.emplace_back(x, s);
	  }
	return p.first->second;
      };

    // Find any transition going into the initial state, and use its
    // acceptance as mark.
    acc_cond::mark_t init_acc = 0U;
    unsigned old_init = old->get_init_state_number();
    for (auto& t: old->transitions())
      if (t.dst == old_init)
	{
	  init_acc = t.acc;
	  break;
	}

    res->set_init_state(new_state(old_init, init_acc));
    while (!todo.empty())
      {
	auto one = todo.back();
	todo.pop_back();
	for (auto& t: old->out(one.first.first))
	  res->new_transition(one.second,
			      new_state(t.dst, t.acc),
			      t.cond,
			      one.first.second);
      }
    return res;
  }
}