Commit 57e7bbb3 authored by Alexandre Duret-Lutz's avatar Alexandre Duret-Lutz
Browse files

Remove is_syntactic_weak_scc and is_syntactic_terminal_scc

Those cannot work now that automata are not labeled by formulas
anymore.

* src/tgbaalgos/isweakscc.cc, src/tgbaalgos/isweakscc.hh
(is_syntactic_weak_scc, is_syntactic_terminal_scc): Remove.
parent ead04cb1
......@@ -89,44 +89,6 @@ namespace spot
== bdd_support(map.get_aut()->neg_acceptance_conditions()));
}
bool
is_syntactic_weak_scc(scc_map& map, unsigned scc)
{
const tgba_explicit_formula* aut =
dynamic_cast<const tgba_explicit_formula*>(map.get_aut());
if (!aut)
return false;
for (auto ss: map.states_of(scc))
{
const state_explicit_formula* s =
down_cast<const state_explicit_formula*>(ss);
assert(s);
if (aut->get_label(s)->is_syntactic_persistence())
return true;
}
return false;
}
bool
is_syntactic_terminal_scc(scc_map& map, unsigned scc)
{
const tgba_explicit_formula* aut =
dynamic_cast<const tgba_explicit_formula*>(map.get_aut());
if (!aut)
return false;
for (auto ss: map.states_of(scc))
{
const state_explicit_formula* s =
down_cast<const state_explicit_formula*>(ss);
assert(s);
if (aut->get_label(s)->is_syntactic_guarantee())
return true;
}
return false;
}
bool
is_complete_scc(scc_map& map, unsigned scc)
{
......
// -*- coding: utf-8 -*-
// Copyright (C) 2012, 2013 Laboratoire de Recherche et Développement de
// l'Epita (LRDE).
// Copyright (C) 2012, 2013, 2014 Laboratoire de Recherche et
// Développement de l'Epita (LRDE).
//
// This file is part of Spot, a model checking library.
//
......@@ -66,28 +66,6 @@ namespace spot
SPOT_API bool
is_complete_scc(scc_map& map, unsigned scc);
/// \brief Whether the SCC number \a scc in \a map is syntactically
/// weak.
///
/// This works only on tgba whose labels are formulas. An SCC is
/// syntactically weak if one of its states is labeled by a
/// syntactic-persistence formula.
///
/// The scc_map \a map should have been built already.
SPOT_API bool
is_syntactic_weak_scc(scc_map& map, unsigned scc);
/// \brief Whether the SCC number \a scc in \a map is syntactically
/// terminal.
///
/// This works only on tgba whose labels are formulas. An SCC is
/// syntactically terminal if one of its states is labeled by a
/// syntactic-guarantee formula.
///
/// The scc_map \a map should have been built already.
SPOT_API bool
is_syntactic_terminal_scc(scc_map& map, unsigned scc);
/// \brief Whether the SCC number \a scc in \a map is terminal.
///
/// An SCC is terminal if it is weak, complete, and accepting.
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment