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.
102 lines
3.8 KiB
C++
102 lines
3.8 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 TωA
|
|
/// with a SAT solver.
|
|
///
|
|
/// \param a the input TωA. It should be a deterministic TωA.
|
|
///
|
|
/// \param target_acc_number is the number of acceptance sets wanted
|
|
/// in the result.
|
|
///
|
|
/// \param target_acc the target acceptance condition
|
|
///
|
|
/// \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.
|
|
///
|
|
/// \param colored if true, force all transitions to belong to
|
|
/// exactly one acceptance set.
|
|
///
|
|
/// This functions attempts to find a TωA with \a target_acc_number
|
|
/// acceptance sets and target_state_number states that is
|
|
/// equivalent to \a a. If no such TωA is found, a null pointer is
|
|
/// returned.
|
|
SPOT_API twa_graph_ptr
|
|
dtwa_sat_synthetize(const const_twa_graph_ptr& a,
|
|
unsigned target_acc_number,
|
|
const acc_cond::acc_code& target_acc,
|
|
int target_state_number,
|
|
bool state_based = false,
|
|
bool colored = false);
|
|
|
|
/// \brief Attempt to minimize a deterministic TωA with a SAT solver.
|
|
///
|
|
/// This calls dtwa_sat_synthetize() in a loop, with a decreasing
|
|
/// number of states, and returns the last successfully built TGBA.
|
|
///
|
|
/// If no smaller TGBA exists, this returns a null pointer.
|
|
SPOT_API twa_graph_ptr
|
|
dtwa_sat_minimize(const const_twa_graph_ptr& a,
|
|
unsigned target_acc_number,
|
|
const acc_cond::acc_code& target_acc,
|
|
bool state_based = false,
|
|
int max_states = -1,
|
|
bool colored = false);
|
|
|
|
/// \brief Attempt to minimize a deterministic TωA with a SAT solver.
|
|
///
|
|
/// This calls dtwa_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
|
|
dtwa_sat_minimize_dichotomy(const const_twa_graph_ptr& a,
|
|
unsigned target_acc_number,
|
|
const acc_cond::acc_code& target_acc,
|
|
bool state_based = false,
|
|
int max_states = -1,
|
|
bool colored = false);
|
|
|
|
/// \brief High-level interface to SAT-based minimization
|
|
///
|
|
/// Minimize the automaton \a aut, using options \a opt.
|
|
/// These options are given as a comma-separated list of
|
|
/// assignments of the form:
|
|
///
|
|
/// states = 10 // synthetize automaton with fixed number of states
|
|
/// max-states = 20 // minimize starting from this upper bound
|
|
/// acc = "generalized-Buchi 2"
|
|
/// acc = "Rabin 3"
|
|
/// acc = "same" /* default */
|
|
/// dichotomy = 1 // use dichotomy instead of decreasing loop
|
|
/// colored = 1 // build a colored TωA
|
|
///
|
|
SPOT_API twa_graph_ptr
|
|
sat_minimize(twa_graph_ptr aut, const char* opt, bool state_based = false);
|
|
}
|