fb63dfc309
Function taking an automaton and trying to relabel it by partitioning the old conditions and encode the different subsets of the partition with new variables * spot/priv/Makefile.am: Add * spot/priv/partitioned_relabel.hh , spot/priv/partitioned_relabel.cc: try_partition_me, computes the partition of a given vector of bdds * spot/twaalgos/relabel.hh , spot/twaalgos/relabel.cc: Here. Adapt also relabel() to cope with the different type of relabeling_maps * tests/python/_partitioned_relabel.ipynb , tests/python/except.py: Test and Usage * tests/Makefile.am: Add test
69 lines
2.7 KiB
C++
69 lines
2.7 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2015, 2017 Laboratoire de Recherche et Développement de
|
|
// l'Epita (LRDE).
|
|
//
|
|
// 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/tl/relabel.hh>
|
|
#include <spot/twa/twagraph.hh>
|
|
#include <spot/misc/bddlt.hh>
|
|
|
|
#include <optional>
|
|
#include <functional>
|
|
|
|
namespace spot
|
|
{
|
|
/// \brief replace atomic propositions in an automaton
|
|
///
|
|
/// The relabeling map \a relmap should have keys that are atomic
|
|
/// propositions, and values that are Boolean formulas.
|
|
///
|
|
/// This function is typically used with maps produced by relabel()
|
|
/// or relabel_bse().
|
|
SPOT_API void
|
|
relabel_here(twa_graph_ptr& aut, relabeling_map* relmap);
|
|
|
|
|
|
/// \brief Replace conditions in \a aut with non-overlapping conditions
|
|
/// over fresh variables.
|
|
///
|
|
/// Partitions the conditions in the automaton, then (binary) encodes
|
|
/// them using fresh propositions.
|
|
/// This can lead to an exponential explosion in the number of
|
|
/// conditions. The operations is aborted if either
|
|
/// the number of new letters (subsets of the partition) exceeds
|
|
/// \a max_letter OR \a max_letter_mult times the number of conditions
|
|
/// in the original automaton.
|
|
/// The argument \a concerned_ap can be used to filter out transitions.
|
|
/// If given, only the transitions whose support intersects the
|
|
/// concerned_ap (or whose condition is T) are taken into account.
|
|
/// The fresh aps will be enumerated and prefixed by \a var_prefix.
|
|
/// These variables need to be fresh, i.e. may not exist yet (not checked)
|
|
///
|
|
/// \note If concerned_ap is given, then there may not be an edge
|
|
/// whose condition uses ap inside AND outside of concerned_ap.
|
|
/// Mostly used in a game setting to distinguish between
|
|
/// env and player transitions.
|
|
SPOT_API relabeling_map
|
|
partitioned_relabel_here(twa_graph_ptr& aut, bool split = false,
|
|
unsigned max_letter = -1u,
|
|
unsigned max_letter_mult = -1u,
|
|
const bdd& concerned_ap = bddtrue,
|
|
std::string var_prefix = "__nv");
|
|
|
|
}
|