a577850eb3
* src/bin/common_finput.cc, src/tgbaalgos/lbtt.cc: Use !empty() instead of size() > 0. * src/bin/ltl2tgta.cc, src/kripke/kripkeexplicit.cc, src/tgbatest/complementation.cc: Avoid useless assignments. * src/bin/ltlcross.cc: Correct mistaken assignment inside assert(). * src/evtgba/symbol.hh, src/tgba/tgbabddcoredata.cc, src/tgba/tgbabddcoredata.hh, src/tgba/tgbasafracomplement.cc (operator=): Do not return a const reference. * src/evtgbatest/ltl2evtgba.cc, src/evtgbatest/product.cc, src/evtgbatest/product.cc: Check indices before using them, not after. * src/kripke/kripkeexplicit.cc, src/kripke/kripkeexplicit.hh, src/tgbatest/randtgba.cc: Pass constant strings by reference. * src/kripke/kripkeprint.cc, src/tgbaalgos/simulation.cc: Remove a useless operation. * src/ltlvisit/simplify.cc: Remove a duplicate condition. * src/misc/formater.hh: Remove unused attribute. * src/misc/modgray.cc: Initialize done_ in the constructor. * src/saba/explicitstateconjunction.cc, src/saba/explicitstateconjunction.hh (operator=): Fix prototype. * src/saba/sabacomplementtgba.cc: Remove unused default constructor. * src/ta/taexplicit.cc, src/ta/taproduct.cc, src/ta/tgtaproduct.cc, src/ta/tgtaproduct.hh, src/taalgos/emptinessta.cc, src/taalgos/minimize.cc, src/taalgos/reachiter.cc, src/taalgos/tgba2ta.cc, src/tgbaalgos/cutscc.cc: Use C++ casts, and ++it instead of it++. * src/taalgos/dotty.cc, src/tgbatest/ltl2tgba.cc: Refine the scope of variables. * src/tgba/tgbakvcomplement.hh (bdd_order): Always initialize bdd_. * src/tgba/tgbasgba.cc, src/tgba/wdbacomp.cc: Use the initialization line to initialize all members.
120 lines
3.3 KiB
C++
120 lines
3.3 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2009, 2010, 2012 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_TGBAKVCOMPLEMENT_HH
|
|
#define SPOT_TGBA_TGBAKVCOMPLEMENT_HH
|
|
|
|
#include <vector>
|
|
#include "bdd.h"
|
|
#include "tgba.hh"
|
|
#include "tgba/tgbasgba.hh"
|
|
|
|
namespace spot
|
|
{
|
|
class bdd_ordered
|
|
{
|
|
public:
|
|
bdd_ordered()
|
|
: bdd_(0), order_(0)
|
|
{};
|
|
|
|
bdd_ordered(int bdd_, unsigned order_)
|
|
: bdd_(bdd_), order_(order_)
|
|
{
|
|
}
|
|
|
|
unsigned order() const
|
|
{
|
|
return order_;
|
|
}
|
|
|
|
unsigned& order()
|
|
{
|
|
return order_;
|
|
}
|
|
|
|
bdd get_bdd() const
|
|
{
|
|
return bdd_ithvar(bdd_);
|
|
}
|
|
private:
|
|
int bdd_;
|
|
unsigned order_;
|
|
};
|
|
|
|
typedef std::vector<bdd_ordered> acc_list_t;
|
|
|
|
/// \brief Build a complemented automaton.
|
|
/// \ingroup tgba_on_the_fly_algorithms
|
|
///
|
|
/// The construction comes from:
|
|
/// \verbatim
|
|
/// @Article{ kupferman.05.tcs,
|
|
/// title = {From complementation to certification},
|
|
/// author = {Kupferman, O. and Vardi, M.Y.},
|
|
/// journal = {Theoretical Computer Science},
|
|
/// volume = {345},
|
|
/// number = {1},
|
|
/// pages = {83--100},
|
|
/// year = {2005},
|
|
/// publisher = {Elsevier}
|
|
/// }
|
|
/// \endverbatim
|
|
///
|
|
/// The original automaton is used as a States-based Generalized
|
|
/// Büchi Automaton.
|
|
///
|
|
/// The construction is done on-the-fly, by the
|
|
/// \c tgba_kv_complement_succ_iterator class.
|
|
/// \see tgba_kv_complement_succ_iterator
|
|
class tgba_kv_complement : public tgba
|
|
{
|
|
public:
|
|
tgba_kv_complement(const tgba* a);
|
|
virtual ~tgba_kv_complement();
|
|
|
|
// tgba interface
|
|
virtual state* get_init_state() const;
|
|
virtual tgba_succ_iterator*
|
|
succ_iter(const state* local_state,
|
|
const state* global_state = 0,
|
|
const tgba* global_automaton = 0) const;
|
|
|
|
virtual bdd_dict* get_dict() const;
|
|
virtual std::string format_state(const state* state) const;
|
|
virtual bdd all_acceptance_conditions() const;
|
|
virtual bdd neg_acceptance_conditions() const;
|
|
protected:
|
|
virtual bdd compute_support_conditions(const state* state) const;
|
|
virtual bdd compute_support_variables(const state* state) const;
|
|
private:
|
|
/// Retrieve all the atomic acceptance conditions of the automaton.
|
|
/// They are inserted into \a acc_list_.
|
|
void get_acc_list();
|
|
private:
|
|
const tgba_sgba_proxy* automaton_;
|
|
bdd the_acceptance_cond_;
|
|
unsigned nb_states_;
|
|
acc_list_t acc_list_;
|
|
}; // end class tgba_kv_complement.
|
|
|
|
} // end namespace spot.
|
|
|
|
|
|
#endif // !SPOT_TGBA_TGBAKVCOMPLEMENT_HH
|