spot 2.12.2
dtbasat.hh
1// -*- coding: utf-8 -*-
2// Copyright (C) by the Spot authors, see the AUTHORS file for details.
3//
4// This file is part of Spot, a model checking library.
5//
6// Spot is free software; you can redistribute it and/or modify it
7// under the terms of the GNU General Public License as published by
8// the Free Software Foundation; either version 3 of the License, or
9// (at your option) any later version.
10//
11// Spot is distributed in the hope that it will be useful, but WITHOUT
12// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13// or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
14// License for more details.
15//
16// You should have received a copy of the GNU General Public License
17// along with this program. If not, see <http://www.gnu.org/licenses/>.
18
19#pragma once
20
21#include <spot/twa/twagraph.hh>
22
23namespace spot
24{
41 SPOT_API twa_graph_ptr
42 dtba_sat_synthetize(const const_twa_graph_ptr& a,
43 int target_state_number,
44 bool state_based = false);
45
52 SPOT_API twa_graph_ptr
53 dtba_sat_minimize(const const_twa_graph_ptr& a,
54 bool state_based = false,
55 int max_states = -1);
56
61 //
63 SPOT_API twa_graph_ptr
64 dtba_sat_minimize_dichotomy(const const_twa_graph_ptr& a,
65 bool state_based = false,
66 bool langmap = false,
67 int max_states = -1);
68
79 SPOT_API twa_graph_ptr
80 dtba_sat_minimize_incr(const const_twa_graph_ptr& a,
81 bool state_based = false,
82 int max_states = -1,
83 int param = 2);
84
98 SPOT_API twa_graph_ptr
99 dtba_sat_minimize_assume(const const_twa_graph_ptr& a,
100 bool state_based = false,
101 int max_states = -1,
102 int param = 6);
103}
Definition: automata.hh:26
twa_graph_ptr dtba_sat_minimize_assume(const const_twa_graph_ptr &a, bool state_based=false, int max_states=-1, int param=6)
Attempt to minimize a deterministic TBA incrementally with a SAT solver.
twa_graph_ptr dtba_sat_minimize_incr(const const_twa_graph_ptr &a, bool state_based=false, int max_states=-1, int param=2)
Attempt to minimize a det. TBA with a SAT solver.
twa_graph_ptr dtba_sat_minimize(const const_twa_graph_ptr &a, bool state_based=false, int max_states=-1)
Attempt to minimize a deterministic TBA with a SAT solver.
twa_graph_ptr dtba_sat_minimize_dichotomy(const const_twa_graph_ptr &a, bool state_based=false, bool langmap=false, int max_states=-1)
Attempt to minimize a deterministic TBA with a SAT solver.
twa_graph_ptr dtba_sat_synthetize(const const_twa_graph_ptr &a, int target_state_number, bool state_based=false)
Attempt to synthetize an equivalent deterministic TBA with a SAT solver.

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Fri Feb 27 2015 10:00:07 for spot by doxygen 1.9.4