bdddict.hh 8.47 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
3
// Copyright (C) 2011, 2012, 2013, 2014 Laboratoire de Recherche et
// Développement de l'Epita (LRDE).
4
// Copyright (C) 2003, 2004, 2006  Laboratoire d'Informatique de Paris 6 (LIP6),
5
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
6
// et Marie Curie.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
7
8
9
10
11
//
// 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
12
// the Free Software Foundation; either version 3 of the License, or
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
13
14
15
16
17
18
19
20
// (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
21
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
22

23
24
25
26
27
#ifndef SPOT_TGBA_BDDDICT_HH
# define SPOT_TGBA_BDDDICT_HH

#include <list>
#include <set>
28
#include <map>
29
#include <iosfwd>
30
#include <bdd.h>
31
#include <vector>
32
#include "ltlast/formula.hh"
33
34
35

namespace spot
{
36
37
  /// \brief Private data for bdd_dict.
  class bdd_dict_priv;
38

39
  /// \ingroup tgba_essentials
40
41
42
43
44
  /// \brief Map BDD variables to formulae.
  ///
  /// The BDD library uses integers to designate Boolean variables in
  /// its decision diagrams.  This class is used to map such integers
  /// to objects actually used in Spot.  These objects are usually
45
  /// atomic propositions, but they can also be acceptance conditions.
46
47
48
49
50
51
52
53
54
  ///
  /// When a BDD variable is registered using a bdd_dict, it is always
  /// associated to a "user" (or "owner") object.  This is done by
  /// supplying the bdd_dict with a pointer to the intended user of
  /// the variable.  When the user object dies, it should release the
  /// BDD variables it was using by calling (for instance)
  /// unregister_all_my_variables(), giving the same pointer.
  /// Variables can also by unregistered one by one using
  /// unregister_variable().
55
  class SPOT_API bdd_dict
56
  {
57
    bdd_dict_priv* priv_;
58
59
60
  public:

    bdd_dict();
61
62
63
64
65

    /// \brief Destroy the BDD dict.
    ///
    /// This always calls assert_emptiness() to diagnose cases where
    /// variables have not been unregistered.
66
67
68
    ~bdd_dict();

    /// Formula-to-BDD-variable maps.
69
    typedef std::map<const ltl::formula*, int> fv_map;
70
    /// BDD-variable-to-formula maps.
71
    typedef std::map<int, const ltl::formula*> vf_map;
72

73
    fv_map var_map;		///< Maps atomic propositions to BDD variables
74
    fv_map acc_map;		///< Maps acceptance conditions to BDD variables
75

76
77
78
    /// BDD-variable reference counts.
    typedef std::set<const void*> ref_set;

79
    enum var_type { anon = 0, var, acc };
80
81
82
83
84
85
86
87
88
89
    struct bdd_info {
      bdd_info() : type(anon) {}
      var_type type;
      const ltl::formula* f;	// Used unless t==anon.
      ref_set refs;
      int clone_counts;
    };
    typedef std::vector<bdd_info> bdd_info_map;
    // Map BDD variables to their meaning.
    bdd_info_map bdd_map;
90

91
92
93
94
95
96
97
98
99
100
    /// \brief Register an atomic proposition.
    ///
    /// Return (and maybe allocate) a BDD variable designating formula
    /// \a f.  The \a for_me argument should point to the object using
    /// this BDD variable, this is used for reference counting.  It is
    /// perfectly safe to call this function several time with the same
    /// arguments.
    ///
    /// \return The variable number.  Use bdd_ithvar() or bdd_nithvar()
    ///   to convert this to a BDD.
101
    int register_proposition(const ltl::formula* f, const void* for_me);
102

103
104
105
106
107
108
109
110
111
    /// \brief Register BDD variables as atomic propositions.
    ///
    /// Register all variables occurring in \a f as atomic propositions
    /// used by \a for_me.  This assumes that these atomic propositions
    /// are already known from the dictionary (i.e., they have already
    /// been registered by register_proposition() for another
    /// automaton).
    void register_propositions(bdd f, const void* for_me);

112
113
114
    /// \brief Register an atomic proposition.
    ///
    /// Return (and maybe allocate) a BDD variable designating an
115
    /// acceptance set associated to formula \a f.  The \a for_me
116
117
118
119
120
121
    /// argument should point to the object using this BDD variable,
    /// this is used for reference counting.  It is perfectly safe to
    /// call this function several time with the same arguments.
    ///
    /// \return The variable number.  Use bdd_ithvar() or bdd_nithvar()
    ///   to convert this to a BDD.
122
    int register_acceptance_variable(const ltl::formula* f, const void* for_me);
123

124
125
126
127
128
129
130
    /// \brief Clone an acceptance variable VAR for FOR_ME.
    ///
    /// This is used in products TGBAs when both operands share the
    /// same acceptance variables but they need to be distinguished in
    /// the result.
    int register_clone_acc(int var, const void* for_me);

131
    /// \brief Register BDD variables as acceptance variables.
132
    ///
133
134
    /// Register all variables occurring in \a f as acceptance variables
    /// used by \a for_me.  This assumes that these acceptance variables
135
    /// are already known from the dictionary (i.e., they have already
136
    /// been registered by register_acceptance_variable() for another
137
    /// automaton).
138
    void register_acceptance_variables(bdd f, const void* for_me);
139

140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
    /// \brief Convert one acceptance condition into the associated
    /// formula.
    ///
    /// This version accepts a conjunction of Acc variables, in which
    /// only one must be positive.  This positive variable will be
    /// converted back into the associated formula.
    ///
    /// The returned formula is not cloned, and is valid until the BDD
    /// variable used in \a oneacc are unregistered.
    const ltl::formula* oneacc_to_formula(bdd oneacc) const;

    /// \brief Convert one acceptance condition into the associated
    /// formula.
    ///
    /// This version takes the number of a BDD variable that must has
    /// been returned by a call to register_acceptance_variable().
    ///
    /// The returned formula is not cloned, and is valid until the BDD
    /// variable \a var is unregistered.
    const ltl::formula* oneacc_to_formula(int var) const;

161
162
163
164
165
166
167
168
169
    /// \brief Register anonymous BDD variables.
    ///
    /// Return (and maybe allocate) \a n consecutive BDD variables which
    /// will be used only by \a for_me.
    ///
    /// \return The variable number.  Use bdd_ithvar() or bdd_nithvar()
    ///   to convert this to a BDD.
    int register_anonymous_variables(int n, const void* for_me);

170
171
172
173
174
175
176
177
    /// \brief Duplicate the variable usage of another object.
    ///
    /// This tells this dictionary that the \a for_me object
    /// will be using the same BDD variables as the \a from_other objects.
    /// This ensure that the variables won't be freed when \a from_other
    /// is deleted if \a from_other is still alive.
    void register_all_variables_of(const void* from_other, const void* for_me);

178
    /// \brief Release all variables used by an object.
179
180
181
    ///
    /// Usually called in the destructor if \a me.
    void unregister_all_my_variables(const void* me);
182
183
184
185

    /// \brief Release all variables of a given type, used by an
    /// object.
    void unregister_all_typed_variables(var_type type, const void* me);
186

187
188
189
    /// \brief Release a variable used by \a me.
    void unregister_variable(int var, const void* me);

190
    /// @{
191
    /// Check whether formula \a f has already been registered by \a by_me.
192
193
    bool is_registered_proposition(const ltl::formula* f, const void* by_me);
    bool is_registered_acceptance_variable(const ltl::formula* f,
194
					   const void* by_me);
195
    /// @}
196
197
198
199
200
201
202

    /// \brief Dump all variables for debugging.
    /// \param os The output stream.
    std::ostream& dump(std::ostream& os) const;

    /// \brief Make sure the dictionary is empty.
    ///
203
204
205
206
207
208
209
210
211
    /// This will print diagnostics if the dictionary is not empty.
    /// Use for debugging.  This is called automatically by the
    /// destructor.  When Spot is compiled in development mode (i.e.,
    /// with <code>./configure --enable-devel</code>), this function
    /// will abort if the dictionary is not empty.
    ///
    /// The errors detected by this function usually indicate missing
    /// calls to unregister_variable() or
    /// unregister_all_my_variables().
212
213
214
215
    void assert_emptiness() const;

  private:
    // Disallow copy.
216
217
    bdd_dict(const bdd_dict& other) SPOT_DELETED;
    bdd_dict& operator=(const bdd_dict& other) SPOT_DELETED;
218
219
220
221
222
223
  };


}

#endif // SPOT_TGBA_BDDDICT_HH