76c676dba0
* src/hoaparse/hoaparse.yy, src/tgba/tgbagraph.hh, src/tgbaalgos/compsusp.cc, src/tgbaalgos/dtgbasat.cc, src/tgbaalgos/mask.cc, src/tgbaalgos/randomgraph.cc, src/tgbaalgos/sccfilter.cc, src/tgbaalgos/simulation.cc, src/tgbaalgos/stripacc.cc, src/tgba/tgba.hh: Here.
521 lines
12 KiB
C++
521 lines
12 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2014, 2015 Laboratoire de Recherche et Développement
|
|
// 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/>.
|
|
|
|
#ifndef SPOT_TGBA_TGBAGRAPH_HH
|
|
# define SPOT_TGBA_TGBAGRAPH_HH
|
|
|
|
#include "fwd.hh"
|
|
#include "graph/graph.hh"
|
|
#include "graph/ngraph.hh"
|
|
#include "tgba/bdddict.hh"
|
|
#include "tgba/tgba.hh"
|
|
#include "tgbaalgos/dupexp.hh"
|
|
#include <sstream>
|
|
|
|
namespace spot
|
|
{
|
|
|
|
struct SPOT_API tgba_graph_state: public spot::state
|
|
{
|
|
public:
|
|
tgba_graph_state():
|
|
spot::state()
|
|
{
|
|
}
|
|
|
|
virtual ~tgba_graph_state() noexcept
|
|
{
|
|
}
|
|
|
|
virtual int compare(const spot::state* other) const
|
|
{
|
|
auto o = down_cast<const tgba_graph_state*>(other);
|
|
assert(o);
|
|
|
|
// Do not simply return "other - this", it might not fit in an int.
|
|
if (o < this)
|
|
return -1;
|
|
if (o > this)
|
|
return 1;
|
|
return 0;
|
|
}
|
|
|
|
virtual size_t hash() const
|
|
{
|
|
return
|
|
reinterpret_cast<const char*>(this) - static_cast<const char*>(nullptr);
|
|
}
|
|
|
|
virtual tgba_graph_state*
|
|
clone() const
|
|
{
|
|
return const_cast<tgba_graph_state*>(this);
|
|
}
|
|
|
|
virtual void destroy() const
|
|
{
|
|
}
|
|
};
|
|
|
|
struct SPOT_API tgba_graph_trans_data
|
|
{
|
|
bdd cond;
|
|
acc_cond::mark_t acc;
|
|
|
|
explicit tgba_graph_trans_data()
|
|
: cond(bddfalse), acc(0)
|
|
{
|
|
}
|
|
|
|
tgba_graph_trans_data(bdd cond, acc_cond::mark_t acc = 0U)
|
|
: cond(cond), acc(acc)
|
|
{
|
|
}
|
|
|
|
bool operator<(const tgba_graph_trans_data& other) const
|
|
{
|
|
if (cond.id() < other.cond.id())
|
|
return true;
|
|
if (cond.id() > other.cond.id())
|
|
return false;
|
|
return acc < other.acc;
|
|
}
|
|
|
|
bool operator==(const tgba_graph_trans_data& other) const
|
|
{
|
|
return cond.id() == other.cond.id() &&
|
|
acc == other.acc;
|
|
}
|
|
};
|
|
|
|
|
|
template<class Graph>
|
|
class SPOT_API tgba_digraph_succ_iterator: public tgba_succ_iterator
|
|
{
|
|
private:
|
|
typedef typename Graph::transition transition;
|
|
typedef typename Graph::state_data_t state;
|
|
const Graph* g_;
|
|
transition t_;
|
|
transition p_;
|
|
|
|
public:
|
|
tgba_digraph_succ_iterator(const Graph* g, transition t)
|
|
: g_(g), t_(t)
|
|
{
|
|
}
|
|
|
|
virtual void recycle(transition t)
|
|
{
|
|
t_ = t;
|
|
}
|
|
|
|
virtual bool first()
|
|
{
|
|
p_ = t_;
|
|
return p_;
|
|
}
|
|
|
|
virtual bool next()
|
|
{
|
|
p_ = g_->trans_storage(p_).next_succ;
|
|
return p_;
|
|
}
|
|
|
|
virtual bool done() const
|
|
{
|
|
return !p_;
|
|
}
|
|
|
|
virtual tgba_graph_state* current_state() const
|
|
{
|
|
assert(!done());
|
|
return const_cast<tgba_graph_state*>
|
|
(&g_->state_data(g_->trans_storage(p_).dst));
|
|
}
|
|
|
|
virtual bdd current_condition() const
|
|
{
|
|
assert(!done());
|
|
return g_->trans_data(p_).cond;
|
|
}
|
|
|
|
virtual acc_cond::mark_t current_acceptance_conditions() const
|
|
{
|
|
assert(!done());
|
|
return g_->trans_data(p_).acc;
|
|
}
|
|
|
|
transition pos() const
|
|
{
|
|
return p_;
|
|
}
|
|
|
|
};
|
|
|
|
class SPOT_API tgba_digraph: public tgba
|
|
{
|
|
public:
|
|
typedef digraph<tgba_graph_state, tgba_graph_trans_data> graph_t;
|
|
typedef graph_t::trans_storage_t trans_storage_t;
|
|
|
|
protected:
|
|
graph_t g_;
|
|
mutable unsigned init_number_;
|
|
|
|
public:
|
|
tgba_digraph(const bdd_dict_ptr& dict)
|
|
: tgba(dict),
|
|
init_number_(0)
|
|
{
|
|
}
|
|
|
|
explicit tgba_digraph(const const_tgba_digraph_ptr& other, prop_set p)
|
|
: tgba(other->get_dict()),
|
|
g_(other->g_), init_number_(other->init_number_)
|
|
{
|
|
copy_acceptance_conditions_of(other);
|
|
copy_ap_of(other);
|
|
prop_copy(other, p);
|
|
}
|
|
|
|
virtual ~tgba_digraph()
|
|
{
|
|
get_dict()->unregister_all_my_variables(this);
|
|
// Prevent this state from being destroyed by ~tgba(),
|
|
// as the state will be destroyed when g_ is destroyed.
|
|
last_support_conditions_input_ = 0;
|
|
}
|
|
|
|
// FIXME: Once we ditch GCC 4.6, we can using a template aliases
|
|
// (supported from GCC 4.7 onward) instead of this.
|
|
template <typename State_Name,
|
|
typename Name_Hash = std::hash<State_Name>,
|
|
typename Name_Equal = std::equal_to<State_Name>>
|
|
struct namer
|
|
{
|
|
typedef named_graph<graph_t, State_Name, Name_Hash, Name_Equal> type;
|
|
};
|
|
|
|
template <typename State_Name,
|
|
typename Name_Hash = std::hash<State_Name>,
|
|
typename Name_Equal = std::equal_to<State_Name>>
|
|
typename namer<State_Name, Name_Hash, Name_Equal>::type*
|
|
create_namer()
|
|
{
|
|
return new named_graph<graph_t, State_Name, Name_Hash, Name_Equal>(g_);
|
|
}
|
|
|
|
graph_t& get_graph()
|
|
{
|
|
return g_;
|
|
}
|
|
|
|
const graph_t& get_graph() const
|
|
{
|
|
return g_;
|
|
}
|
|
|
|
unsigned num_states() const
|
|
{
|
|
return g_.num_states();
|
|
}
|
|
|
|
unsigned num_transitions() const
|
|
{
|
|
return g_.num_transitions();
|
|
}
|
|
|
|
void set_init_state(graph_t::state s)
|
|
{
|
|
assert(s < num_states());
|
|
init_number_ = s;
|
|
}
|
|
|
|
void set_init_state(const state* s)
|
|
{
|
|
set_init_state(state_number(s));
|
|
}
|
|
|
|
graph_t::state get_init_state_number() const
|
|
{
|
|
if (num_states() == 0)
|
|
const_cast<graph_t&>(g_).new_state();
|
|
return init_number_;
|
|
}
|
|
|
|
// FIXME: The return type ought to be const.
|
|
virtual tgba_graph_state* get_init_state() const
|
|
{
|
|
if (num_states() == 0)
|
|
const_cast<graph_t&>(g_).new_state();
|
|
return const_cast<tgba_graph_state*>(state_from_number(init_number_));
|
|
}
|
|
|
|
virtual tgba_succ_iterator*
|
|
succ_iter(const state* st) const
|
|
{
|
|
auto s = down_cast<const typename graph_t::state_storage_t*>(st);
|
|
assert(s);
|
|
assert(!s->succ || g_.valid_trans(s->succ));
|
|
|
|
if (this->iter_cache_)
|
|
{
|
|
auto it =
|
|
down_cast<tgba_digraph_succ_iterator<graph_t>*>(this->iter_cache_);
|
|
it->recycle(s->succ);
|
|
this->iter_cache_ = nullptr;
|
|
return it;
|
|
}
|
|
return new tgba_digraph_succ_iterator<graph_t>(&g_, s->succ);
|
|
}
|
|
|
|
graph_t::state
|
|
state_number(const state* st) const
|
|
{
|
|
auto s = down_cast<const typename graph_t::state_storage_t*>(st);
|
|
assert(s);
|
|
return s - &g_.state_storage(0);
|
|
}
|
|
|
|
const tgba_graph_state*
|
|
state_from_number(graph_t::state n) const
|
|
{
|
|
return &g_.state_data(n);
|
|
}
|
|
|
|
std::string format_state(unsigned n) const
|
|
{
|
|
std::stringstream ss;
|
|
ss << n;
|
|
return ss.str();
|
|
}
|
|
|
|
virtual std::string format_state(const state* st) const
|
|
{
|
|
return format_state(state_number(st));
|
|
}
|
|
|
|
tgba_graph_trans_data& trans_data(const tgba_succ_iterator* it)
|
|
{
|
|
auto* i = down_cast<const tgba_digraph_succ_iterator<graph_t>*>(it);
|
|
return g_.trans_data(i->pos());
|
|
}
|
|
|
|
tgba_graph_trans_data& trans_data(unsigned t)
|
|
{
|
|
return g_.trans_data(t);
|
|
}
|
|
|
|
const tgba_graph_trans_data& trans_data(const tgba_succ_iterator* it) const
|
|
{
|
|
auto* i = down_cast<const tgba_digraph_succ_iterator<graph_t>*>(it);
|
|
return g_.trans_data(i->pos());
|
|
}
|
|
|
|
const tgba_graph_trans_data& trans_data(unsigned t) const
|
|
{
|
|
return g_.trans_data(t);
|
|
}
|
|
|
|
void set_generalized_buchi(unsigned num)
|
|
{
|
|
if (num < acc_.num_sets())
|
|
{
|
|
acc_.~acc_cond();
|
|
new (&acc_) acc_cond;
|
|
}
|
|
acc_.add_sets(num - acc_.num_sets());
|
|
prop_single_acc_set(!acc_.uses_fin_acceptance() && num == 1);
|
|
if (num == 0)
|
|
prop_state_based_acc();
|
|
acc_.set_generalized_buchi();
|
|
}
|
|
|
|
acc_cond::mark_t set_single_acceptance_set()
|
|
{
|
|
set_generalized_buchi(1);
|
|
return acc_.mark(0);
|
|
}
|
|
|
|
trans_storage_t& trans_storage(const tgba_succ_iterator* it)
|
|
{
|
|
auto* i = down_cast<const tgba_digraph_succ_iterator<graph_t>*>(it);
|
|
return g_.trans_storage(i->pos());
|
|
}
|
|
|
|
trans_storage_t& trans_storage(unsigned t)
|
|
{
|
|
return g_.trans_storage(t);
|
|
}
|
|
|
|
const trans_storage_t
|
|
trans_storage(const tgba_succ_iterator* it) const
|
|
{
|
|
auto* i = down_cast<const tgba_digraph_succ_iterator<graph_t>*>(it);
|
|
return g_.trans_storage(i->pos());
|
|
}
|
|
|
|
const trans_storage_t trans_storage(unsigned t) const
|
|
{
|
|
return g_.trans_storage(t);
|
|
}
|
|
|
|
void set_generalized_buchi(bdd all);
|
|
|
|
unsigned new_state()
|
|
{
|
|
return g_.new_state();
|
|
}
|
|
|
|
unsigned new_states(unsigned n)
|
|
{
|
|
return g_.new_states(n);
|
|
}
|
|
|
|
unsigned new_transition(unsigned src, unsigned dst,
|
|
bdd cond, acc_cond::mark_t acc = 0U)
|
|
{
|
|
return g_.new_transition(src, dst, cond, acc);
|
|
}
|
|
|
|
unsigned new_acc_transition(unsigned src, unsigned dst,
|
|
bdd cond, bool acc = true)
|
|
{
|
|
if (acc)
|
|
return g_.new_transition(src, dst, cond, acc_.all_sets());
|
|
else
|
|
return g_.new_transition(src, dst, cond);
|
|
}
|
|
|
|
auto out(unsigned src) const
|
|
SPOT_RETURN(g_.out(src));
|
|
auto out(unsigned src)
|
|
SPOT_RETURN(g_.out(src));
|
|
|
|
auto states() const
|
|
SPOT_RETURN(g_.states());
|
|
auto states()
|
|
SPOT_RETURN(g_.states());
|
|
|
|
auto transitions() const
|
|
SPOT_RETURN(g_.transitions());
|
|
auto transitions()
|
|
SPOT_RETURN(g_.transitions());
|
|
|
|
auto transition_vector() const
|
|
SPOT_RETURN(g_.transition_vector());
|
|
auto transition_vector()
|
|
SPOT_RETURN(g_.transition_vector());
|
|
|
|
auto is_dead_transition(const graph_t::trans_storage_t& t) const
|
|
SPOT_RETURN(g_.is_dead_transition(t));
|
|
|
|
/// \brief Copy the acceptance conditions of another tgba.
|
|
void copy_acceptance_conditions_of(const const_tgba_ptr& a)
|
|
{
|
|
// FIXME: Should rename as copy_acceptance_condition*_of
|
|
acc_ = a->acc();
|
|
unsigned num = acc_.num_sets();
|
|
prop_single_acc_set(!acc_.uses_fin_acceptance() && num == 1);
|
|
if (num == 0)
|
|
prop_state_based_acc();
|
|
}
|
|
|
|
void copy_ap_of(const const_tgba_ptr& a)
|
|
{
|
|
get_dict()->register_all_propositions_of(a, this);
|
|
}
|
|
|
|
virtual bdd compute_support_conditions(const state* s) const
|
|
{
|
|
bdd sum = bddfalse;
|
|
for (auto& t: out(state_number(s)))
|
|
sum |= t.cond;
|
|
return sum;
|
|
}
|
|
|
|
/// Iterate over all transitions, and merge those with compatible
|
|
/// extremities and acceptance.
|
|
void merge_transitions();
|
|
|
|
/// Remove all states without successors.
|
|
void purge_dead_states();
|
|
|
|
/// Remove all unreachable states.
|
|
void purge_unreachable_states();
|
|
|
|
bool state_is_accepting(unsigned s) const
|
|
{
|
|
assert(has_state_based_acc() || acc_.num_sets() == 0);
|
|
for (auto& t: g_.out(s))
|
|
// Stop at the first transition, since the remaining should be
|
|
// labeled identically.
|
|
return acc_.accepting(t.acc);
|
|
return false;
|
|
}
|
|
|
|
bool state_is_accepting(const state* s) const
|
|
{
|
|
return state_is_accepting(state_number(s));
|
|
}
|
|
|
|
bool operator==(const tgba_digraph& aut) const
|
|
{
|
|
if (num_states() != aut.num_states() ||
|
|
num_transitions() != aut.num_transitions() ||
|
|
acc().num_sets() != aut.acc().num_sets())
|
|
return false;
|
|
auto& trans1 = transition_vector();
|
|
auto& trans2 = aut.transition_vector();
|
|
return std::equal(trans1.begin() + 1, trans1.end(),
|
|
trans2.begin() + 1);
|
|
}
|
|
};
|
|
|
|
inline tgba_digraph_ptr make_tgba_digraph(const bdd_dict_ptr& dict)
|
|
{
|
|
return std::make_shared<tgba_digraph>(dict);
|
|
}
|
|
|
|
inline tgba_digraph_ptr make_tgba_digraph(const tgba_digraph_ptr& aut,
|
|
tgba::prop_set p)
|
|
{
|
|
return std::make_shared<tgba_digraph>(aut, p);
|
|
}
|
|
|
|
inline tgba_digraph_ptr make_tgba_digraph(const const_tgba_digraph_ptr& aut,
|
|
tgba::prop_set p)
|
|
{
|
|
return std::make_shared<tgba_digraph>(aut, p);
|
|
}
|
|
|
|
inline tgba_digraph_ptr make_tgba_digraph(const const_tgba_ptr& aut,
|
|
tgba::prop_set p)
|
|
{
|
|
auto a = std::dynamic_pointer_cast<const tgba_digraph>(aut);
|
|
if (a)
|
|
return std::make_shared<tgba_digraph>(a, p);
|
|
else
|
|
return tgba_dupexp_dfs(aut, p);
|
|
}
|
|
|
|
}
|
|
|
|
#endif // SPOT_TGBA_TGBAGRAPH_HH
|