000c041a95
src/ltlast/refformula.hh, src/ltlenv/defaultenv.hh, src/misc/bareword.hh, src/tgba/succiter.hh, src/tgba/tgbabddfactory.hh, src/tgba/tgbareduc.hh, src/tgbaalgos/dupexp.hh, src/tgbaalgos/emptiness_stats.hh, src/tgbaalgos/ltl2tgba_fm.hh, src/tgbaalgos/ltl2tgba_lacim.hh, src/tgbaalgos/reductgba_sim.hh, src/tgbaalgos/tau03opt.hh: Add or fix include guards. * src/sanity/includes.test: Check the presence of the include guard.
102 lines
3.3 KiB
C++
102 lines
3.3 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_SUCCITER_HH
|
|
# define SPOT_TGBA_SUCCITER_HH
|
|
|
|
#include "state.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// \brief Iterate over the successors of a state.
|
|
/// \ingroup tgba_essentials
|
|
///
|
|
/// This class provides the basic functionalities required to
|
|
/// iterate over the successors of a state, as well as querying
|
|
/// transition labels. Because transitions are never explicitely
|
|
/// encoded, labels (conditions and acceptance conditions) can only
|
|
/// be queried while iterating over the successors.
|
|
class tgba_succ_iterator
|
|
{
|
|
public:
|
|
virtual
|
|
~tgba_succ_iterator()
|
|
{
|
|
}
|
|
|
|
/// \name Iteration
|
|
//@{
|
|
|
|
/// \brief Position the iterator on the first successor (if any).
|
|
///
|
|
/// This method can be called several times to make multiple
|
|
/// passes over successors.
|
|
///
|
|
/// \warning One should always call \c done() to
|
|
/// ensure there is a successor, even after \c first(). A
|
|
/// common trap is to assume that there is at least one
|
|
/// successor: this is wrong.
|
|
virtual void first() = 0;
|
|
|
|
/// \brief Jump to the next successor (if any).
|
|
///
|
|
/// \warning Again, one should always call \c done() to ensure
|
|
/// there is a successor.
|
|
virtual void next() = 0;
|
|
|
|
/// \brief Check whether the iteration is finished.
|
|
///
|
|
/// This function should be called after any call to \c first()
|
|
/// or \c next() and before any enquiry about the current state.
|
|
///
|
|
/// The usual way to do this is with a \c for loop.
|
|
/// \code
|
|
/// for (s->first(); !s->done(); s->next())
|
|
/// ...
|
|
/// \endcode
|
|
virtual bool done() const = 0;
|
|
|
|
//@}
|
|
|
|
/// \name Inspection
|
|
//@{
|
|
|
|
/// \brief Get the state of the current successor.
|
|
///
|
|
/// Note that the same state may occur at different points
|
|
/// in the iteration. These actually correspond to the same
|
|
/// destination. It just means there were several transitions,
|
|
/// with different conditions, leading to the same state.
|
|
virtual state* current_state() const = 0;
|
|
/// \brief Get the condition on the transition leading to this successor.
|
|
///
|
|
/// This is a boolean function of atomic propositions.
|
|
virtual bdd current_condition() const = 0;
|
|
/// \brief Get the acceptance conditions on the transition leading
|
|
/// to this successor.
|
|
virtual bdd current_acceptance_conditions() const = 0;
|
|
|
|
//@}
|
|
};
|
|
}
|
|
|
|
|
|
#endif // SPOT_TGBA_SUCCITER_HH
|