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

20
#pragma once
21

22
#include <spot/twa/twagraph.hh>
23
24
25

namespace spot
{
26
27
  /// \brief Attempt to synthetize an equivalent deterministic TBA
  /// with a SAT solver.
28
  ///
29
  /// \param a the input TGA.  It should have only one acceptance
30
  /// set and be deterministic.  I.e., it should be a deterministic TBA.
31
  ///
32
33
34
  /// \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.
35
  ///
36
37
38
39
  /// \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.
  ///
40
41
  /// If no equivalent deterministic TBA with \a target_state_number
  /// states is found, a null pointer
42
43
  SPOT_API twa_graph_ptr
  dtba_sat_synthetize(const const_twa_graph_ptr& a,
44
45
                      int target_state_number,
                      bool state_based = false);
46
47
48
49
50
51
52

  /// \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
54
  SPOT_API twa_graph_ptr
  dtba_sat_minimize(const const_twa_graph_ptr& a,
55
56
                    bool state_based = false,
                    int max_states = -1);
57
58
59
60
61
62
63

  /// \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.
64
65
  SPOT_API twa_graph_ptr
  dtba_sat_minimize_dichotomy(const const_twa_graph_ptr& a,
66
                              bool state_based = false,
67
                              bool langmap = false,
68
                              int max_states = -1);
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84

  /// \brief Attempt to minimize a det. TBA with a SAT solver.
  ///
  /// This acts like dtba_sat_synthetize() and obtains a first minimized
  /// automaton. Then, incrementally, it encodes the deletion of one state
  /// and solves it as many time as param value.
  /// If param >= 0, this process is fully repeated until the minimal automaton
  /// is found. Otherwise, it continues to delete states one by one
  /// incrementally until the minimal automaton is found.
  ///
  /// If no smaller TBA exist, this returns a null pointer.
  SPOT_API twa_graph_ptr
  dtba_sat_minimize_incr(const const_twa_graph_ptr& a,
                         bool state_based = false,
                         int max_states = -1,
                         int param = 2);
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103

  /// \brief Attempt to minimize a deterministic TBA incrementally with a SAT
  /// solver.
  ///
  /// This acts like dtba_sat_synthetize() and obtains a first minimized
  /// automaton. Then, it adds <param> assumptions, such that each assumption
  /// removes a new state and implies the previous assumptions. A first
  /// resolution is attempted assuming the last assumption (thus involving all
  /// the previous ones). If the problem is SAT several stages have just been
  /// won and all this process is restarted. Otherwise, we know that the
  /// minimal automaton can be obtained with fewer assumption. This
  /// automaton is found dichotomously.
  ///
  /// If no smaller TBA exist, this returns a null pointer.
  SPOT_API twa_graph_ptr
  dtba_sat_minimize_assume(const const_twa_graph_ptr& a,
                    bool state_based = false,
                    int max_states = -1,
                    int param = 6);
104
}