// -*- coding: utf-8 -*-
// Copyright (C) by the Spot authors, see the AUTHORS file for details.
//
// 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/misc/common.hh>
#include <spot/twa/fwd.hh>
#include <vector>

namespace spot
{
  /// \ingroup twa_algorithms
  /// \brief Analyze dependent outputs in an NBA represented as a graph.
  ///
  /// This follows the dependency-analysis method from \cite akshay.24.tacas.
  ///
  /// This computes compatible state pairs and then greedily builds a
  /// subset-maximal set of dependent outputs, following the order in
  /// \a outputs.
  /// Output propositions are referred to by their BDD variable numbers.
  ///
  /// \param aut     automaton to analyze
  /// \param outputs BDD variable numbers of output propositions to test
  ///
  /// \return the subset-maximal set of dependent output variables.
  SPOT_API std::vector<int>
  analyze_dependent_output(const const_twa_graph_ptr& aut,
                           const std::vector<int>& outputs);
}
