96e2da8666
* doc/org/satmin.org: Document the new DTωA-minimization procedure. * doc/org/tools.org: Fix link. * src/bin/autfilt.cc: Pass -S to sat_minimize(). * src/twa/twagraph.hh: (state_acc_sets) New method. * src/twaalgos/dotty.cc: Use it to correctly display co-Büchi automata. * src/twaalgos/dtbasat.cc: Set the deterministic property on the result. * src/twaalgos/dtgbasat.cc: Likewise, and preprocess the input automaton in sat_minimize(). * src/twaalgos/dtgbasat.hh: Fix documentation, and take the state-based information as an argument. * src/twaalgos/postproc.cc: Do not call simulation-based reduction on non-separated acceptances. * src/tests/satmin2.test: Use -S rather than 'state-based'. * NEWS: Update.
96 lines
3.6 KiB
C++
96 lines
3.6 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 "twa/twagraph.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_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, 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 twa_graph_ptr
|
|
dtgba_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);
|
|
|
|
/// \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 twa_graph_ptr
|
|
dtgba_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);
|
|
|
|
/// \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 twa_graph_ptr
|
|
dtgba_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);
|
|
|
|
/// \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
|
|
///
|
|
SPOT_API twa_graph_ptr
|
|
sat_minimize(twa_graph_ptr aut, const char* opt, bool state_based = false);
|
|
}
|