c2ae99e779
Now that we support any type of omega-accetpance, not just "Generalized Büchi", it is time to move away from GB and replace it by "ω", written just w in ASCII. This just change the name of the tgba class. This part has to be done by hand because the word "tgba" occurs in many contexts and a mass replacement would be wrong. This will be followed by some automatic renaming of all the derived types and more. * src/bin/autfilt.cc, src/bin/randaut.cc, src/kripke/fairkripke.hh, src/ta/tgta.cc, src/ta/tgta.hh, src/tgba/fwd.hh, src/tgba/taatgba.cc, src/tgba/taatgba.hh, src/tgba/tgba.cc, src/tgba/tgba.hh, src/tgba/tgbagraph.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/tgbaalgos/are_isomorphic.cc, src/tgbaalgos/cleanacc.cc, src/tgbaalgos/dotty.cc, src/tgbaalgos/dupexp.cc, src/tgbaalgos/dupexp.hh, src/tgbaalgos/hoa.cc, src/tgbaalgos/neverclaim.cc, src/tgbaalgos/simulation.cc, src/tgbaalgos/stutter.cc, src/tgbatest/checkpsl.cc, src/tgbatest/emptchk.cc, src/tgbatest/ltl2tgba.cc, wrap/python/spot.py, wrap/python/spot_impl.i: Rename the tgba class into twa.
108 lines
3.6 KiB
C++
108 lines
3.6 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2009, 2010, 2013, 2014, 2015 Laboratoire de Recherche et
|
|
// Developpement de l'Epita
|
|
//
|
|
// 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 "tgba/tgba.hh"
|
|
#include "fwd.hh"
|
|
|
|
/// \addtogroup kripke Kripke Structures
|
|
/// \ingroup tgba
|
|
|
|
namespace spot
|
|
{
|
|
/// \ingroup kripke
|
|
/// \brief Iterator code for a Fair Kripke structure.
|
|
///
|
|
/// This iterator can be used to simplify the writing
|
|
/// of an iterator on a Fair Kripke structure (or lookalike).
|
|
///
|
|
/// If you inherit from this iterator, you should only
|
|
/// redefine
|
|
///
|
|
/// - fair_kripke_succ_iterator::first()
|
|
/// - fair_kripke_succ_iterator::next()
|
|
/// - fair_kripke_succ_iterator::done()
|
|
/// - fair_kripke_succ_iterator::current_state()
|
|
///
|
|
/// This class implements fair_kripke_succ_iterator::current_condition(),
|
|
/// and fair_kripke_succ_iterator::current_acceptance_conditions().
|
|
class SPOT_API fair_kripke_succ_iterator : public tgba_succ_iterator
|
|
{
|
|
public:
|
|
/// \brief Constructor
|
|
///
|
|
/// The \a cond and \a acc_cond arguments will be those returned
|
|
/// by fair_kripke_succ_iterator::current_condition(),
|
|
/// and fair_kripke_succ_iterator::current_acceptance_conditions().
|
|
fair_kripke_succ_iterator(const bdd& cond, acc_cond::mark_t acc_cond);
|
|
virtual ~fair_kripke_succ_iterator();
|
|
|
|
virtual bdd current_condition() const;
|
|
virtual acc_cond::mark_t current_acceptance_conditions() const;
|
|
protected:
|
|
bdd cond_;
|
|
acc_cond::mark_t acc_cond_;
|
|
};
|
|
|
|
/// \ingroup kripke
|
|
/// \brief Interface for a Fair Kripke structure.
|
|
///
|
|
/// A Kripke structure is a graph in which each node (=state) is
|
|
/// labeled by a conjunction of atomic proposition, and a set of
|
|
/// acceptance conditions.
|
|
///
|
|
/// Such a structure can be seen as spot::tgba by pushing all labels
|
|
/// to the outgoing transitions.
|
|
///
|
|
/// A programmer that develops an instance of Fair Kripke structure
|
|
/// needs just provide an implementation for the following methods:
|
|
///
|
|
/// - kripke::get_init_state()
|
|
/// - kripke::succ_iter()
|
|
/// - kripke::state_condition()
|
|
/// - kripke::state_acceptance_conditions()
|
|
/// - kripke::format_state()
|
|
/// - and optionally kripke::transition_annotation()
|
|
///
|
|
/// The other methods of the tgba interface are supplied by this
|
|
/// class and need not be defined.
|
|
///
|
|
/// See also spot::fair_kripke_succ_iterator.
|
|
class SPOT_API fair_kripke: public twa
|
|
{
|
|
public:
|
|
fair_kripke(const bdd_dict_ptr& d)
|
|
: twa(d)
|
|
{
|
|
}
|
|
|
|
/// \brief The condition that label the state \a s.
|
|
///
|
|
/// This should be a conjunction of atomic propositions.
|
|
virtual bdd state_condition(const state* s) const = 0;
|
|
|
|
/// \brief The set of acceptance conditions that label the state \a s.
|
|
virtual acc_cond::mark_t
|
|
state_acceptance_conditions(const state* s) const = 0;
|
|
|
|
protected:
|
|
virtual bdd compute_support_conditions(const state* s) const;
|
|
};
|
|
}
|