f120dd3206
* NEWS: Mention the change. * src/: Rename as ... * spot/: ... this, adjust all headers to include <spot/...> instead of "...", and adjust all Makefile.am to search headers from the top-level directory. * HACKING: Add conventions about #include. * spot/sanity/style.test: Add a few more grep to catch cases that do not follow these conventions. * .gitignore, Makefile.am, README, bench/stutter/Makefile.am, bench/stutter/stutter_invariance_formulas.cc, bench/stutter/stutter_invariance_randomgraph.cc, configure.ac, debian/rules, doc/Doxyfile.in, doc/Makefile.am, doc/org/.dir-locals.el.in, doc/org/g++wrap.in, doc/org/init.el.in, doc/org/tut01.org, doc/org/tut02.org, doc/org/tut03.org, doc/org/tut10.org, doc/org/tut20.org, doc/org/tut21.org, doc/org/tut22.org, doc/org/tut30.org, iface/ltsmin/Makefile.am, iface/ltsmin/kripke.test, iface/ltsmin/ltsmin.cc, iface/ltsmin/ltsmin.hh, iface/ltsmin/modelcheck.cc, wrap/python/Makefile.am, wrap/python/ajax/spotcgi.in, wrap/python/spot_impl.i, wrap/python/tests/ltl2tgba.py, wrap/python/tests/randgen.py, wrap/python/tests/run.in: Adjust.
68 lines
2.5 KiB
C++
68 lines
2.5 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2013, 2014, 2015 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 <spot/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,
|
|
int max_states = -1);
|
|
|
|
/// \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,
|
|
int max_states = -1);
|
|
}
|