Automatic mass renaming. * src/tgbaalgos/: Rename as... * src/twaalgos/: ... this. * README, configure.ac, iface/ltsmin/modelcheck.cc, src/Makefile.am, src/bin/autfilt.cc, src/bin/common_aoutput.cc, src/bin/common_aoutput.hh, src/bin/common_output.hh, src/bin/common_post.hh, src/bin/dstar2tgba.cc, src/bin/ltl2tgba.cc, src/bin/ltl2tgta.cc, src/bin/ltlcross.cc, src/bin/ltldo.cc, src/bin/ltlfilt.cc, src/bin/randaut.cc, src/dstarparse/dra2ba.cc, src/dstarparse/nra2nba.cc, src/dstarparse/nsa2tgba.cc, src/graphtest/twagraph.cc, src/kripke/kripkeprint.cc, src/ltlvisit/contain.cc, src/ltlvisit/contain.hh, src/ltlvisit/exclusive.cc, src/taalgos/emptinessta.hh, src/tgbatest/checkpsl.cc, src/tgbatest/checkta.cc, src/tgbatest/complementation.cc, src/tgbatest/emptchk.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/ltlprod.cc, src/tgbatest/randtgba.cc, src/tgbatest/taatgba.cc, src/twa/twa.cc, src/twa/twagraph.hh, src/twa/twasafracomplement.cc, wrap/python/spot_impl.i: Adjust.
54 lines
1.9 KiB
C++
54 lines
1.9 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2014 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 "twa/twagraph.hh"
|
|
#include <vector>
|
|
|
|
namespace spot
|
|
{
|
|
/// Check if two automata are isomorphic.
|
|
class SPOT_API isomorphism_checker
|
|
{
|
|
public:
|
|
isomorphism_checker(const const_twa_graph_ptr ref);
|
|
|
|
/// \ingroup twa_misc
|
|
/// \brief Check whether an automaton is isomorphic to the one passed to
|
|
/// the constructor.
|
|
///
|
|
/// Two automata are considered isomorphic if there exists a bijection f
|
|
/// between the states of a1 and the states of a2 such that for any pair of
|
|
/// states (s1, s2) of a1, there is a transition from s1 to s2 with
|
|
/// condition c and acceptance set A iff there is a transition with
|
|
/// condition c and acceptance set A between f(s1) and f(s2) in a2.
|
|
/// This can be done simply by checking if
|
|
/// canonicalize(aut1) == canonicalize(aut2), but is_isomorphic can do some
|
|
/// optimizations in some cases.
|
|
bool
|
|
is_isomorphic(const const_twa_graph_ptr aut);
|
|
|
|
private:
|
|
twa_graph_ptr ref_;
|
|
bool ref_deterministic_ = false;
|
|
unsigned nondet_states_ = 0;
|
|
std::vector<twa_graph::graph_t::trans_storage_t> reftrans_;
|
|
};
|
|
}
|