0874980574
This is still missing tests. * src/bin/autfilt.cc: Add a --sat-minimize option. * src/misc/optionmap.cc, src/misc/optionmap.hh: Allow passing strings. * src/twa/acc.cc, src/twa/acc.hh: Add helper functions needed by the SAT-encoder. * src/twaalgos/complete.hh: Typos. * src/twaalgos/dtbasat.hh: Adjust comment. * src/twaalgos/dtgbasat.cc, src/twaalgos/dtgbasat.hh: Generalize to take the target acceptance as input. * src/twaalgos/postproc.cc, src/tests/ltl2tgba.cc: Adjust calls. * src/twaalgos/sbacc.cc, src/twaalgos/sbacc.hh: Don't pass the pointer by reference. * src/tests/acc.cc, src/tests/acc.test: More tests for the acceptance helper function.
66 lines
2.5 KiB
C++
66 lines
2.5 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/>.
|
|
|
|
#pragma once
|
|
|
|
#include "twa/twagraph.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// \brief Attempt to synthetize an equivalent deterministic TBA
|
|
/// with a SAT solver.
|
|
///
|
|
/// \param a the input TGA. It should have only one acceptance
|
|
/// set and be deterministic. I.e., it should be a deterministic TBA.
|
|
///
|
|
/// \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.
|
|
///
|
|
/// \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.
|
|
///
|
|
/// If no equivalent deterministic TBA with \a target_state_number
|
|
/// states is found, a null pointer
|
|
SPOT_API twa_graph_ptr
|
|
dtba_sat_synthetize(const const_twa_graph_ptr& 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.
|
|
SPOT_API twa_graph_ptr
|
|
dtba_sat_minimize(const const_twa_graph_ptr& 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.
|
|
SPOT_API twa_graph_ptr
|
|
dtba_sat_minimize_dichotomy(const const_twa_graph_ptr& a,
|
|
bool state_based = false);
|
|
}
|