61791baf4c
* src/tgbaalgos/dtbasat.cc, src/tgbaalgos/dtbasat.hh, src/tgbaalgos/dtgbasat.cc, src/tgbaalgos/dtgbasat.hh: Use tgba_digraph and modernize syntax slightly.
73 lines
2.7 KiB
C++
73 lines
2.7 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement
|
|
// 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_DTGBASAT_HH
|
|
# define SPOT_TGBAALGOS_DTGBASAT_HH
|
|
|
|
#include "tgba/tgbagraph.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// \brief Attempt to synthetize am equivalent deterministic TGBA
|
|
/// with a SAT solver.
|
|
///
|
|
/// \param a the input TGBA. It should be a deterministic TGBA.
|
|
///
|
|
/// \param target_acc_number is the number of acceptance sets wanted
|
|
/// in the result.
|
|
///
|
|
/// \param target_state_number is the desired number of states in
|
|
/// the result. The output may have less than \a
|
|
/// target_state_number reachable states.
|
|
///
|
|
/// \param state_based set to true to force all outgoing transitions
|
|
/// of a state to share the same acceptance conditions, effectively
|
|
/// turning the TGBA into a TBA.
|
|
///
|
|
/// This functions attempts to find a TGBA with \a target_acc_number
|
|
/// acceptance sets and target_state_number states that is
|
|
/// equivalent to \a a. If no such TGBA is found, a null pointer is
|
|
/// returned.
|
|
SPOT_API tgba_digraph*
|
|
dtgba_sat_synthetize(const tgba* a, unsigned target_acc_number,
|
|
int target_state_number,
|
|
bool state_based = false);
|
|
|
|
/// \brief Attempt to minimize a deterministic TGBA with a SAT solver.
|
|
///
|
|
/// This calls dtgba_sat_synthetize() in a loop, with a decreasing
|
|
/// number of states, and returns the last successfully built TGBA.
|
|
///
|
|
/// If no smaller TGBA exist, this returns a null pointer.
|
|
SPOT_API tgba_digraph*
|
|
dtgba_sat_minimize(const tgba* a, unsigned target_acc_number,
|
|
bool state_based = false);
|
|
|
|
/// \brief Attempt to minimize a deterministic TGBA with a SAT solver.
|
|
///
|
|
/// This calls dtgba_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.
|
|
SPOT_API tgba_digraph*
|
|
dtgba_sat_minimize_dichotomy(const tgba* a, unsigned target_acc_number,
|
|
bool state_based = false);
|
|
}
|
|
|
|
#endif // SPOT_TGBAALGOS_DTGBASAT_HH
|