a2cbe9cab8
* bench/emptchk/ltl-human.sh, bench/emptchk/ltl-random.sh, src/sanity/style.test, src/tgba/bdddict.cc, src/tgba/succiterconcrete.hh, src/tgba/tgbabddcoredata.hh, src/tgba/tgbareduc.cc, src/tgba/tgbareduc.hh, src/tgbaalgos/gv04.cc, src/tgbaalgos/gv04.hh, src/tgbaalgos/magic.cc, src/tgbaalgos/magic.hh, src/tgbaalgos/se05.cc, src/tgbaalgos/se05.hh, src/tgbaalgos/tau03.cc, src/tgbaalgos/tau03.hh, src/tgbaalgos/tau03opt.cc, src/tgbaalgos/tau03opt.hh, src/tgbatest/dfs.test: Replace them by "acceptance condition".
72 lines
2.7 KiB
C++
72 lines
2.7 KiB
C++
// Copyright (C) 2003, 2004, 2005 Laboratoire d'Informatique de Paris 6 (LIP6),
|
|
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
|
// et Marie Curie.
|
|
//
|
|
// 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 2 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 Spot; see the file COPYING. If not, write to the Free
|
|
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
// 02111-1307, USA.
|
|
|
|
#ifndef SPOT_TGBA_SUCCITERCONCRETE_HH
|
|
# define SPOT_TGBA_SUCCITERCONCRETE_HH
|
|
|
|
#include "statebdd.hh"
|
|
#include "succiter.hh"
|
|
#include "tgbabddcoredata.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// A concrete iterator over successors of a TGBA state.
|
|
/// \ingroup tgba_representation
|
|
class tgba_succ_iterator_concrete: public tgba_succ_iterator
|
|
{
|
|
public:
|
|
/// \brief Build a spot::tgba_succ_iterator_concrete.
|
|
///
|
|
/// \param successors The set of successors with ingoing
|
|
/// conditions and acceptance conditions, represented as a BDD.
|
|
/// The job of this iterator will be to enumerate the
|
|
/// satisfactions of that BDD and split them into destination
|
|
/// states and conditions, and compute acceptance conditions.
|
|
/// \param d The core data of the automata.
|
|
/// These contains sets of variables useful to split a BDD, and
|
|
/// compute acceptance conditions.
|
|
tgba_succ_iterator_concrete(const tgba_bdd_core_data& d, bdd successors);
|
|
virtual ~tgba_succ_iterator_concrete();
|
|
|
|
// iteration
|
|
void first();
|
|
void next();
|
|
bool done() const;
|
|
|
|
// inspection
|
|
state_bdd* current_state() const;
|
|
bdd current_condition() const;
|
|
bdd current_acceptance_conditions() const;
|
|
|
|
private:
|
|
const tgba_bdd_core_data& data_; ///< Core data of the automaton.
|
|
bdd succ_set_; ///< The set of successors.
|
|
bdd succ_set_left_; ///< Unexplored successors (including current_).
|
|
bdd current_; ///< \brief Current successor, as a conjunction of
|
|
/// atomic proposition and Next variables.
|
|
bdd current_state_; ///< \brief Current successor, as a
|
|
/// conjunction of Now variables.
|
|
bdd current_acc_; ///< \brief Acceptance conditions for the current
|
|
/// transition.
|
|
};
|
|
}
|
|
|
|
#endif // SPOT_TGBA_SUCCITERCONCRETE_HH
|