Rename the class taa as taa_tgba.
* src/tgba/taa.cc, src/tgba/taa.hh: Rename as ... * src/tgba/taatgba.cc, src/tgba/taatgba.hh: ... these, and rename the class taa as taa_tgba. * src/tgbaalgos/ltl2taa.cc, src/tgbaalgos/ltl2taa.hh, src/tgbaalgos/Makefile.am: Adjust. * src/tgbatest/ltl2tgba.cc, src/tgbatest/Makefile.am: Adjust. * src/tgbatest/taa.test: Rename as ... * src/tgbatest/taatgba.test ... this. * src/tgbatest/taa.cc: Rename as ... * src/tgbatest/taatgba.cc ... this, and adjust.
This commit is contained in:
Guillaume Sadegh
parent
d362e752d1
commit
f00aa49dc3
9 changed files with 117 additions and 101 deletions
198
src/tgba/taatgba.hh
Normal file
198
src/tgba/taatgba.hh
Normal file
|
|
@ -0,0 +1,198 @@
|
|||
// Copyright (C) 2009 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_TAATGBA_HH
|
||||
# define SPOT_TGBA_TAATGBA_HH
|
||||
|
||||
#include <set>
|
||||
#include <iosfwd>
|
||||
#include <vector>
|
||||
#include "misc/hash.hh"
|
||||
#include "ltlast/formula.hh"
|
||||
#include "bdddict.hh"
|
||||
#include "tgba.hh"
|
||||
|
||||
namespace spot
|
||||
{
|
||||
/// \brief A Transition-based Alternating Automaton (TAA).
|
||||
class taa_tgba : public tgba
|
||||
{
|
||||
public:
|
||||
taa_tgba(bdd_dict* dict);
|
||||
|
||||
struct transition;
|
||||
typedef std::list<transition*> state;
|
||||
typedef std::set<state*> state_set;
|
||||
|
||||
/// Explicit transitions.
|
||||
struct transition
|
||||
{
|
||||
bdd condition;
|
||||
bdd acceptance_conditions;
|
||||
const state_set* dst;
|
||||
};
|
||||
|
||||
void set_init_state(const std::string& state);
|
||||
void set_init_state(const std::vector<std::string>& state);
|
||||
|
||||
transition*
|
||||
create_transition(const std::string& src,
|
||||
const std::vector<std::string>& dst);
|
||||
transition*
|
||||
create_transition(const std::string& src, const std::string& dst);
|
||||
|
||||
void add_condition(transition* t, const ltl::formula* f);
|
||||
void add_acceptance_condition(transition* t, const ltl::formula* f);
|
||||
|
||||
/// \brief Output a TAA.
|
||||
void output(std::ostream& os) const;
|
||||
|
||||
/// TGBA interface.
|
||||
virtual ~taa_tgba();
|
||||
virtual spot::state* get_init_state() const;
|
||||
virtual tgba_succ_iterator*
|
||||
succ_iter(const spot::state* local_state,
|
||||
const spot::state* global_state = 0,
|
||||
const tgba* global_automaton = 0) const;
|
||||
virtual bdd_dict* get_dict() const;
|
||||
|
||||
/// \brief Format the state as a string for printing.
|
||||
///
|
||||
/// If state is a spot::state_set of only one element, then the
|
||||
/// string corresponding to state->get_state() is returned.
|
||||
///
|
||||
/// Otherwise a string composed of each string corresponding to
|
||||
/// each state->get_state() in the spot::state_set is returned,
|
||||
/// e.g. like {string_1,...,string_n}.
|
||||
virtual std::string format_state(const spot::state* state) const;
|
||||
|
||||
virtual bdd all_acceptance_conditions() const;
|
||||
virtual bdd neg_acceptance_conditions() const;
|
||||
|
||||
protected:
|
||||
virtual bdd compute_support_conditions(const spot::state* state) const;
|
||||
virtual bdd compute_support_variables(const spot::state* state) const;
|
||||
|
||||
typedef Sgi::hash_map<
|
||||
const std::string, taa_tgba::state*, string_hash
|
||||
> ns_map;
|
||||
|
||||
typedef Sgi::hash_map<
|
||||
const taa_tgba::state*, std::string, ptr_hash<taa_tgba::state>
|
||||
> sn_map;
|
||||
|
||||
typedef std::vector<taa_tgba::state_set*> ss_vec;
|
||||
|
||||
ns_map name_state_map_;
|
||||
sn_map state_name_map_;
|
||||
bdd_dict* dict_;
|
||||
mutable bdd all_acceptance_conditions_;
|
||||
mutable bool all_acceptance_conditions_computed_;
|
||||
bdd neg_acceptance_conditions_;
|
||||
taa_tgba::state_set* init_;
|
||||
ss_vec state_set_vec_;
|
||||
|
||||
private:
|
||||
// Disallow copy.
|
||||
taa_tgba(const taa_tgba& other);
|
||||
taa_tgba& operator=(const taa_tgba& other);
|
||||
|
||||
/// \brief Return the taa_tgba::state for \a name, creating it if it
|
||||
/// does not exist. The first state added is the initial state
|
||||
/// which can be overridden with set_init_state.
|
||||
taa_tgba::state* add_state(const std::string& name);
|
||||
|
||||
/// \brief Return the taa::state_set for \a names.
|
||||
taa_tgba::state_set* add_state_set(const std::vector<std::string>& names);
|
||||
|
||||
/// \brief Format a taa::state_set as a string for printing.
|
||||
std::string format_state_set(const taa_tgba::state_set* ss) const;
|
||||
};
|
||||
|
||||
/// Set of states deriving from spot::state.
|
||||
class state_set : public spot::state
|
||||
{
|
||||
public:
|
||||
state_set(const taa_tgba::state_set* s, bool delete_me = false)
|
||||
: s_(s), delete_me_(delete_me)
|
||||
{
|
||||
}
|
||||
|
||||
virtual int compare(const spot::state*) const;
|
||||
virtual size_t hash() const;
|
||||
virtual state_set* clone() const;
|
||||
|
||||
virtual ~state_set()
|
||||
{
|
||||
if (delete_me_)
|
||||
delete s_;
|
||||
}
|
||||
|
||||
const taa_tgba::state_set* get_state() const;
|
||||
private:
|
||||
const taa_tgba::state_set* s_;
|
||||
bool delete_me_;
|
||||
};
|
||||
|
||||
class taa_succ_iterator : public tgba_succ_iterator
|
||||
{
|
||||
public:
|
||||
taa_succ_iterator(const taa_tgba::state_set* s, bdd all_acc);
|
||||
virtual ~taa_succ_iterator();
|
||||
|
||||
virtual void first();
|
||||
virtual void next();
|
||||
virtual bool done() const;
|
||||
|
||||
virtual state_set* current_state() const;
|
||||
virtual bdd current_condition() const;
|
||||
virtual bdd current_acceptance_conditions() const;
|
||||
|
||||
private:
|
||||
/// Those typedefs are used to generate all possible successors in
|
||||
/// the constructor using a cartesian product.
|
||||
typedef taa_tgba::state::const_iterator iterator;
|
||||
typedef std::pair<iterator, iterator> iterator_pair;
|
||||
typedef std::vector<iterator_pair> bounds_t;
|
||||
typedef Sgi::hash_multimap<
|
||||
const spot::state_set*, taa_tgba::transition*, state_ptr_hash,
|
||||
state_ptr_equal> seen_map;
|
||||
|
||||
struct distance_sort :
|
||||
public std::binary_function<const iterator_pair&,
|
||||
const iterator_pair&, bool>
|
||||
{
|
||||
bool
|
||||
operator()(const iterator_pair& lhs, const iterator_pair& rhs) const
|
||||
{
|
||||
return std::distance(lhs.first, lhs.second) <
|
||||
std::distance(rhs.first, rhs.second);
|
||||
}
|
||||
};
|
||||
|
||||
std::vector<taa_tgba::transition*>::const_iterator i_;
|
||||
std::vector<taa_tgba::transition*> succ_;
|
||||
bdd all_acceptance_conditions_;
|
||||
seen_map seen_;
|
||||
};
|
||||
}
|
||||
|
||||
#endif // SPOT_TGBA_TAATGBA_HH
|
||||
Loading…
Add table
Add a link
Reference in a new issue