* iface/dve2/dve2.cc, src/kripke/kripkeexplicit.cc, src/kripke/kripkeexplicit.hh, src/ta/tgtaexplicit.cc, src/ta/tgtaexplicit.hh, src/ta/tgtaproduct.cc, src/ta/tgtaproduct.hh, src/tgba/taatgba.cc, src/tgba/taatgba.hh, src/tgba/tgba.hh, src/tgba/tgbabddconcrete.cc, src/tgba/tgbabddconcrete.hh, src/tgba/tgbaexplicit.hh, src/tgba/tgbakvcomplement.cc, src/tgba/tgbakvcomplement.hh, src/tgba/tgbamask.cc, src/tgba/tgbamask.hh, src/tgba/tgbaproduct.cc, src/tgba/tgbaproduct.hh, src/tgba/tgbaproxy.cc, src/tgba/tgbaproxy.hh, src/tgba/tgbasafracomplement.cc, src/tgba/tgbasafracomplement.hh, src/tgba/tgbascc.cc, src/tgba/tgbascc.hh, src/tgba/tgbasgba.cc, src/tgba/tgbasgba.hh, src/tgba/tgbatba.cc, src/tgba/tgbatba.hh, src/tgba/tgbaunion.cc, src/tgba/tgbaunion.hh, src/tgba/wdbacomp.cc: Here. * NEWS: Mention it.
161 lines
4.4 KiB
C++
161 lines
4.4 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2009, 2011, 2013, 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/>.
|
|
|
|
#ifndef SPOT_TGBA_TGBAUNION_HH
|
|
# define SPOT_TGBA_TGBAUNION_HH
|
|
|
|
#include "tgba.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// \ingroup tgba_on_the_fly_algorithms
|
|
/// \brief A state for spot::tgba_union.
|
|
///
|
|
/// This state is in fact a pair.
|
|
/// If the first member equals 0 and the second is different from 0,
|
|
/// the state belongs to the left automaton.
|
|
/// If the first member is different from 0 and the second is 0,
|
|
/// the state belongs to the right automaton.
|
|
/// If both members are 0, the state is the initial state.
|
|
class SPOT_API state_union : public state
|
|
{
|
|
public:
|
|
/// \brief Constructor
|
|
/// \param left The state from the left automaton.
|
|
/// \param right The state from the right automaton.
|
|
/// These states are acquired by spot::state_union, and will
|
|
/// be destroyed on destruction.
|
|
state_union(state* left, state* right)
|
|
: left_(left),
|
|
right_(right)
|
|
{
|
|
}
|
|
|
|
/// Copy constructor
|
|
state_union(const state_union& o);
|
|
|
|
virtual ~state_union();
|
|
|
|
state*
|
|
left() const
|
|
{
|
|
return left_;
|
|
}
|
|
|
|
state*
|
|
right() const
|
|
{
|
|
return right_;
|
|
}
|
|
|
|
virtual int compare(const state* other) const;
|
|
virtual size_t hash() const;
|
|
virtual state_union* clone() const;
|
|
|
|
private:
|
|
state* left_; ///< Does the state belongs
|
|
/// to the left automaton ?
|
|
state* right_; ///< Does the state belongs
|
|
/// to the right automaton ?
|
|
};
|
|
|
|
/// \brief Iterate over the successors of an union computed on the fly.
|
|
class SPOT_API tgba_succ_iterator_union: public tgba_succ_iterator
|
|
{
|
|
public:
|
|
tgba_succ_iterator_union(tgba_succ_iterator* left,
|
|
tgba_succ_iterator* right,
|
|
bdd left_missing,
|
|
bdd right_missing, bdd left_var, bdd right_var);
|
|
|
|
void recycle(const tgba* l, tgba_succ_iterator* left,
|
|
const tgba* r, tgba_succ_iterator* right);
|
|
|
|
virtual ~tgba_succ_iterator_union();
|
|
|
|
// iteration
|
|
bool first();
|
|
bool next();
|
|
bool done() const;
|
|
|
|
// inspection
|
|
state_union* current_state() const;
|
|
bdd current_condition() const;
|
|
bdd current_acceptance_conditions() const;
|
|
|
|
protected:
|
|
tgba_succ_iterator* left_;
|
|
tgba_succ_iterator* right_;
|
|
bdd current_cond_;
|
|
bdd left_missing_;
|
|
bdd right_missing_;
|
|
bdd left_neg_;
|
|
bdd right_neg_;
|
|
friend class tgba_union;
|
|
};
|
|
|
|
/// \brief A lazy union. (States are computed on the fly.)
|
|
class SPOT_API tgba_union: public tgba
|
|
{
|
|
public:
|
|
/// \brief Constructor.
|
|
/// \param left The left automata in the union.
|
|
/// \param right The right automata in the union.
|
|
tgba_union(const tgba* left, const tgba* right);
|
|
|
|
virtual ~tgba_union();
|
|
|
|
virtual state* get_init_state() const;
|
|
|
|
virtual tgba_succ_iterator_union*
|
|
succ_iter(const state* state) const;
|
|
|
|
virtual bdd_dict* get_dict() const;
|
|
|
|
virtual std::string format_state(const state* state) const;
|
|
|
|
virtual state* project_state(const state* s, const tgba* t) const;
|
|
|
|
virtual bdd all_acceptance_conditions() const;
|
|
virtual bdd neg_acceptance_conditions() const;
|
|
|
|
protected:
|
|
virtual bdd compute_support_conditions(const state* state) const;
|
|
|
|
private:
|
|
bdd_dict* dict_;
|
|
const tgba* left_;
|
|
const tgba* right_;
|
|
bdd left_acc_missing_;
|
|
bdd right_acc_missing_;
|
|
bdd left_acc_complement_;
|
|
bdd right_acc_complement_;
|
|
bdd left_var_missing_;
|
|
bdd right_var_missing_;
|
|
bdd all_acceptance_conditions_;
|
|
bdd neg_acceptance_conditions_;
|
|
// Disallow copy.
|
|
tgba_union(const tgba_union&) SPOT_DELETED;
|
|
tgba_union& operator=(const tgba_union&) SPOT_DELETED;
|
|
};
|
|
|
|
|
|
}
|
|
|
|
#endif // SPOT_TGBA_TGBAUNION_HH
|