powerset.hh 2.6 KB
Newer Older
1
2
3
// Copyright (C) 2011 Laboratoire de Recherche et Développement de
// l'Epita.
// Copyright (C) 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
// et Marie Curie.
//
// 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.

#ifndef SPOT_TGBAALGOS_POWERSET_HH
# define SPOT_TGBAALGOS_POWERSET_HH

27
# include <list>
28
# include <map>
29
30
31
32
# include "tgba/tgbaexplicit.hh"

namespace spot
{
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80

  struct power_map
  {
    typedef std::set<const state*, state_ptr_less_than> power_state;
    typedef std::map<int, power_state> power_map_data;
    typedef Sgi::hash_set<const state*, state_ptr_hash,
			  state_ptr_equal> state_set;

    ~power_map()
    {
      // Release all states.
      state_set::const_iterator i = states.begin();
      while (i != states.end())
	{
	  // Advance the iterator before deleting the key.
	  const state* s = *i;
	  ++i;
	  delete s;
	}
    }

    const power_state&
    states_of(int s) const
    {
      return map_.find(s)->second;
    }

    const state*
    canonicalize(const state* s)
    {
      state_set::const_iterator i = states.find(s);
      if (i != states.end())
	{
	  delete s;
	  s = *i;
	}
      else
	{
	  states.insert(s);
	}
      return s;
    }

    power_map_data map_;
    state_set states;
  };


81
  /// \brief Build a deterministic automaton, ignoring acceptance conditions.
82
  /// \ingroup tgba_misc
83
  ///
84
  /// This create a deterministic automaton that recognizes the
85
86
  /// same language as \a aut would if its acceptance conditions
  /// were ignored.  This is the classical powerset algorithm.
87
88
89
90
91
92
93
  ///
  /// If \a pm is supplied it will be filled with the set of original states
  /// associated to each state of the deterministic automaton.
  //@{
  tgba_explicit_number* tgba_powerset(const tgba* aut, power_map& pm);
  tgba_explicit_number* tgba_powerset(const tgba* aut);
  //@}
94
95
96
}

#endif // SPOT_TGBAALGOS_POWERSET_HH