dtbasat.hh 2.48 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
// 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/>.

#ifndef SPOT_TGBAALGOS_DTBASAT_HH
# define SPOT_TGBAALGOS_DTBASAT_HH

23
#include "tgba/tgbagraph.hh"
24
25
26

namespace spot
{
27
28
  /// \brief Attempt to synthetize an equivalent deterministic TBA
  /// with a SAT solver.
29
  ///
30
31
  /// \param a the input TGBA.  It should have only one acceptance
  /// set and be deterministic.  I.e., it should be a deterministic TBA.
32
  ///
33
34
35
  /// \param target_state_number the desired number of states wanted
  /// in the resulting automaton.  The result may have less than \a
  /// target_state_number reachable states.
36
  ///
37
38
39
40
  /// \param state_based set to true to force all outgoing transitions
  /// of a state to share the same acceptance condition, effectively
  /// turning the TBA into a BA.
  ///
41
42
  /// If no equivalent deterministic TBA with \a target_state_number
  /// states is found, a null pointer
43
  SPOT_API tgba_digraph*
44
45
46
47
48
49
50
51
52
  dtba_sat_synthetize(const tgba* a, int target_state_number,
		      bool state_based = false);

  /// \brief Attempt to minimize a deterministic TBA with a SAT solver.
  ///
  /// This calls dtba_sat_synthetize() in a loop, with a decreasing
  /// number of states, and returns the last successfully built TBA.
  ///
  /// If no smaller TBA exist, this returns a null pointer.
53
  SPOT_API tgba_digraph*
54
55
56
57
58
59
60
61
  dtba_sat_minimize(const tgba* a, bool state_based = false);

  /// \brief Attempt to minimize a deterministic TBA with a SAT solver.
  ///
  /// This calls dtba_sat_synthetize() in a loop, but attempting to
  /// find the minimum number of states using a binary search.
  //
  /// If no smaller TBA exist, this returns a null pointer.
62
  SPOT_API tgba_digraph*
63
  dtba_sat_minimize_dichotomy(const tgba* a, bool state_based = false);
64
65
66
}

#endif // SPOT_TGBAALGOS_DTBASAT_HH