// -*- 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/twa/twagraph.hh>
#include <vector>

namespace spot
{
  /// \ingroup twa_misc
  /// \brief transform edges into transitions
  ///
  /// Create a new version of the automaton where all edges are split
  /// so that they are all labeled by a conjunction of all atomic
  /// propositions. After this we can consider that each edge of the
  /// automate is a transition labeled by one letter.
  SPOT_API twa_graph_ptr split_edges(const const_twa_graph_ptr& aut);

  /// \ingroup twa_misc
  /// \brief transform edges into transitions based on set of bdds
  ///
  /// Create a new version of the automaton where all edges are split
  /// such that, for any transformed edge and any set of symbols in
  /// the basis, the transformed edge is either completely disjoint
  /// from the set of symbols, or it is a subset of them.
  SPOT_API twa_graph_ptr split_edges(
    const const_twa_graph_ptr& aut, std::vector<bdd> const& basis);
}
