9f6924ccfb
* spot/twa/twagraph.hh, spot/twaalgos/are_isomorphic.cc, spot/twaalgos/canonicalize.cc, spot/twaalgos/couvreurnew.cc, spot/twaalgos/cycles.cc, spot/twaalgos/degen.cc, spot/twaalgos/determinize.cc, spot/twaalgos/isunamb.cc, spot/twaalgos/isweakscc.cc, spot/twaalgos/mask.hh, spot/twaalgos/minimize.cc, spot/twaalgos/product.cc, spot/twaalgos/randomize.cc, spot/twaalgos/sbacc.cc, spot/twaalgos/sccfilter.cc, spot/twaalgos/simulation.cc: Throw a runtime_error if the input is alternating.
111 lines
3.5 KiB
C++
111 lines
3.5 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2012, 2013, 2014, 2015, 2016 Laboratoire de Recherche
|
|
// et Developpement de l'Epita (LRDE).
|
|
//
|
|
// 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/>.
|
|
|
|
#include <spot/tl/formula.hh>
|
|
#include <spot/twaalgos/isweakscc.hh>
|
|
#include <spot/twaalgos/mask.hh>
|
|
|
|
namespace spot
|
|
{
|
|
bool
|
|
scc_has_rejecting_cycle(scc_info& map, unsigned scc)
|
|
{
|
|
auto aut = map.get_aut();
|
|
if (aut->is_alternating())
|
|
throw std::runtime_error
|
|
("scc_has_rejecting_cycle() does not support alternation");
|
|
// We check that by cloning the SCC and complementing its
|
|
// acceptance condition.
|
|
std::vector<bool> keep(aut->num_states(), false);
|
|
auto& states = map.states_of(scc);
|
|
for (auto s: states)
|
|
keep[s] = true;
|
|
auto sccaut = mask_keep_accessible_states(aut, keep, states.front());
|
|
sccaut->set_acceptance(sccaut->acc().num_sets(),
|
|
sccaut->get_acceptance().complement());
|
|
return !sccaut->is_empty();
|
|
}
|
|
|
|
bool
|
|
is_inherently_weak_scc(scc_info& map, unsigned scc)
|
|
{
|
|
if (map.get_aut()->is_alternating())
|
|
throw std::runtime_error
|
|
("is_inherently_weak_scc() does not support alternation");
|
|
// Weak SCCs are inherently weak.
|
|
if (is_weak_scc(map, scc))
|
|
return true;
|
|
// If we reach this place, we now the SCC has an accepting cycle.
|
|
// The question is now to find whether is also contains a
|
|
// rejecting cycle.
|
|
return !scc_has_rejecting_cycle(map, scc);
|
|
}
|
|
|
|
bool
|
|
is_weak_scc(scc_info& map, unsigned scc)
|
|
{
|
|
if (map.get_aut()->is_alternating())
|
|
throw std::runtime_error
|
|
("is_weak_scc() does not support alternation");
|
|
|
|
// Rejecting SCCs are weak.
|
|
if (map.is_rejecting_scc(scc))
|
|
return true;
|
|
// If all transitions use the same acceptance set, the SCC is weak.
|
|
return map.used_acc_of(scc).size() == 1;
|
|
}
|
|
|
|
bool
|
|
is_complete_scc(scc_info& map, unsigned scc)
|
|
{
|
|
auto a = map.get_aut();
|
|
if (a->is_alternating())
|
|
throw std::runtime_error
|
|
("is_complete_scc() does not support alternation");
|
|
for (auto s: map.states_of(scc))
|
|
{
|
|
bool has_succ = false;
|
|
bdd sumall = bddfalse;
|
|
for (auto& t: a->out(s))
|
|
{
|
|
has_succ = true;
|
|
if (map.scc_of(t.dst) == scc)
|
|
sumall |= t.cond;
|
|
if (sumall == bddtrue)
|
|
break;
|
|
}
|
|
if (!has_succ || sumall != bddtrue)
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
is_terminal_scc(scc_info& map, unsigned scc)
|
|
{
|
|
if (map.get_aut()->is_alternating())
|
|
throw std::runtime_error
|
|
("is_terminal_scc() does not support alternation");
|
|
|
|
// If all transitions use all acceptance conditions, the SCC is weak.
|
|
return (map.is_accepting_scc(scc)
|
|
&& map.used_acc_of(scc).size() == 1
|
|
&& is_complete_scc(map, scc));
|
|
}
|
|
}
|