2fb436a174
This involves reimplementing some algorithms using tgba_digraph, and implementing an explicit product that takes two tgba_digraphs and produces a tgba_digraph. * src/tgbaalgos/product.cc, src/tgbaalgos/product.hh: New files. * src/tgbaalgos/Makefile.am: Adjust. * src/bin/ltlcross.cc, src/tgba/tgba.cc, src/tgba/tgba.hh, src/tgba/tgbasafracomplement.cc, src/tgba/tgbasafracomplement.hh, src/tgbaalgos/cycles.cc, src/tgbaalgos/cycles.hh, src/tgbaalgos/degen.cc, src/tgbaalgos/degen.hh, src/tgbaalgos/isweakscc.cc, src/tgbaalgos/isweakscc.hh, src/tgbaalgos/minimize.cc, src/tgbaalgos/minimize.hh, src/tgbaalgos/powerset.cc, src/tgbaalgos/powerset.hh, src/tgbaalgos/safety.cc, src/tgbaalgos/safety.hh, src/tgbaalgos/sccinfo.cc, src/tgbaalgos/sccinfo.hh, src/tgbatest/complementation.cc, src/tgbatest/emptchk.cc, src/tgbatest/ltl2ta.test, src/tgbatest/ltl2tgba.cc, src/tgbatest/randtgba.cc: Update to use scc_info and/or tgba_digraph.
64 lines
2.3 KiB
C++
64 lines
2.3 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2010, 2011, 2013, 2014 Laboratoire de Recherche et
|
|
// Développement 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/>.
|
|
|
|
#ifndef SPOT_TGBAALGOS_SAFETY_HH
|
|
# define SPOT_TGBAALGOS_SAFETY_HH
|
|
|
|
#include "sccinfo.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// \brief Whether an automaton represents a guarantee property.
|
|
///
|
|
/// A weak deterministic TGBA represents a guarantee property if any
|
|
/// accepting path ends on an accepting state with only one
|
|
/// transition that is a self-loop labelled by true.
|
|
///
|
|
/// Note that in the general case, this is only a sufficient
|
|
/// condition : some guarantee automata might not be recognized with
|
|
/// this check e.g. because of some non-determinism in the
|
|
/// automaton. In that case, you should interpret a \c false return
|
|
/// value as "I don't know".
|
|
///
|
|
/// If you apply this function on a weak deterministic TGBA
|
|
/// (e.g. after a successful minimization with
|
|
/// minimize_obligation()), then the result leaves no doubt: false
|
|
/// really means that the automaton is not a guarantee property.
|
|
///
|
|
/// \param aut the automaton to check
|
|
///
|
|
/// \param sm an scc_info object for the automaton if available (it
|
|
/// will be built otherwise).
|
|
SPOT_API bool
|
|
is_guarantee_automaton(const const_tgba_digraph_ptr& aut,
|
|
const scc_info* sm = 0);
|
|
|
|
/// \brief Whether a minimized WDBA represents a safety property.
|
|
///
|
|
/// A minimized WDBA (as returned by a successful run of
|
|
/// minimize_obligation()) represent safety property if it contains
|
|
/// only accepting transitions.
|
|
///
|
|
/// \param aut the automaton to check
|
|
SPOT_API bool
|
|
is_safety_mwdba(const const_tgba_digraph_ptr& aut);
|
|
|
|
}
|
|
|
|
#endif // SPOT_TGBAALGOS_SAFETY_HH
|