34e91b7656
* bench/scc-stats/stats.cc, bench/split-product/cutscc.cc, iface/gspn/ssp.cc, src/bin/ltlcross.cc, src/bin/ltlfilt.cc, src/bin/randltl.cc, src/dstarparse/nsa2tgba.cc, src/ltlast/formula.hh, src/ltlast/nfa.hh, src/ltlvisit/contain.hh, src/ltlvisit/dotty.cc, src/ltlvisit/mark.hh, src/ltlvisit/relabel.cc, src/ltlvisit/relabel.hh, src/ltlvisit/simplify.cc, src/ltlvisit/snf.hh, src/misc/hash.hh, src/misc/mspool.hh, src/priv/acccompl.hh, src/priv/accconv.hh, src/saba/explicitstateconjunction.hh, src/saba/sabastate.hh, src/sabaalgos/sabareachiter.hh, src/sanity/style.test, src/ta/taexplicit.cc, src/ta/taexplicit.hh, src/taalgos/emptinessta.cc, src/taalgos/minimize.cc, src/taalgos/reachiter.hh, src/tgba/state.hh, src/tgba/taatgba.hh, src/tgba/tgbabddconcretefactory.hh, src/tgba/tgbaexplicit.hh, src/tgba/tgbakvcomplement.cc, src/tgba/tgbasafracomplement.cc, src/tgba/tgbatba.cc, src/tgba/tgbatba.hh, src/tgbaalgos/cutscc.cc, src/tgbaalgos/cycles.hh, src/tgbaalgos/degen.cc, src/tgbaalgos/dtbasat.cc, src/tgbaalgos/dtgbasat.cc, src/tgbaalgos/eltl2tgba_lacim.cc, src/tgbaalgos/emptiness.cc, src/tgbaalgos/gtec/explscc.hh, src/tgbaalgos/gtec/nsheap.hh, src/tgbaalgos/gv04.cc, src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/magic.cc, src/tgbaalgos/minimize.cc, src/tgbaalgos/ndfs_result.hxx, src/tgbaalgos/powerset.hh, src/tgbaalgos/randomgraph.cc, src/tgbaalgos/reachiter.hh, src/tgbaalgos/replayrun.cc, src/tgbaalgos/safety.cc, src/tgbaalgos/scc.hh, src/tgbaalgos/se05.cc, src/tgbaalgos/simulation.cc, src/tgbaalgos/tau03.cc, src/tgbaalgos/tau03opt.cc: Adjust code. * src/sanity/style.test: Remove check.
69 lines
2 KiB
C++
69 lines
2 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2012, 2013 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/>.
|
|
|
|
#ifndef SPOT_LTLVISIT_RELABEL_HH
|
|
# define SPOT_LTLVISIT_RELABEL_HH
|
|
|
|
#include "ltlast/formula.hh"
|
|
#include "misc/hash.hh"
|
|
|
|
namespace spot
|
|
{
|
|
namespace ltl
|
|
{
|
|
enum relabeling_style { Abc, Pnn };
|
|
|
|
|
|
struct relabeling_map: public std::unordered_map<const formula*,
|
|
const formula*,
|
|
ptr_hash<formula>>
|
|
{
|
|
~relabeling_map()
|
|
{
|
|
for (iterator i = begin(); i != end(); ++i)
|
|
i->second->destroy();
|
|
}
|
|
};
|
|
|
|
/// \ingroup ltl_rewriting
|
|
/// \brief Relabel the atomic propositions in a formula.
|
|
///
|
|
/// If \a m is non-null, it is filled with correspondence
|
|
/// between the new names (keys) and the old names (values).
|
|
SPOT_API
|
|
const formula* relabel(const formula* f, relabeling_style style,
|
|
relabeling_map* m = 0);
|
|
|
|
|
|
/// \ingroup ltl_rewriting
|
|
/// \brief Relabel Boolean subexpressions in a formula using
|
|
/// atomic propositions.
|
|
///
|
|
/// If \a m is non-null, it is filled with correspondence
|
|
/// between the new names (keys) and the old names (values).
|
|
SPOT_API
|
|
const formula* relabel_bse(const formula* f, relabeling_style style,
|
|
relabeling_map* m = 0);
|
|
|
|
}
|
|
}
|
|
|
|
|
|
|
|
#endif // SPOT_LTLVISIT_RELABEL_HH
|