a2cbe9cab8
* bench/emptchk/ltl-human.sh, bench/emptchk/ltl-random.sh, src/sanity/style.test, src/tgba/bdddict.cc, src/tgba/succiterconcrete.hh, src/tgba/tgbabddcoredata.hh, src/tgba/tgbareduc.cc, src/tgba/tgbareduc.hh, src/tgbaalgos/gv04.cc, src/tgbaalgos/gv04.hh, src/tgbaalgos/magic.cc, src/tgbaalgos/magic.hh, src/tgbaalgos/se05.cc, src/tgbaalgos/se05.hh, src/tgbaalgos/tau03.cc, src/tgbaalgos/tau03.hh, src/tgbaalgos/tau03opt.cc, src/tgbaalgos/tau03opt.hh, src/tgbatest/dfs.test: Replace them by "acceptance condition".
60 lines
2.2 KiB
C++
60 lines
2.2 KiB
C++
// Copyright (C) 2004, 2005 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_TGBAALGOS_GV04_HH
|
|
# define SPOT_TGBAALGOS_GV04_HH
|
|
|
|
#include "misc/optionmap.hh"
|
|
|
|
namespace spot
|
|
{
|
|
class tgba;
|
|
class emptiness_check;
|
|
|
|
/// \brief Emptiness check based on Geldenhuys and Valmari's
|
|
/// TACAS'04 paper.
|
|
/// \ingroup emptiness_check_algorithms
|
|
/// \pre The automaton \a a must have at most one acceptance condition.
|
|
///
|
|
/// The original algorithm, coming from the following paper, has only
|
|
/// been slightly modified to work on transition-based automata.
|
|
/// \verbatim
|
|
/// @InProceedings{geldenhuys.04.tacas,
|
|
/// author = {Jaco Geldenhuys and Antti Valmari},
|
|
/// title = {Tarjan's Algorithm Makes On-the-Fly {LTL} Verification
|
|
/// More Efficient},
|
|
/// booktitle = {Proceedings of the 10th International Conference on Tools
|
|
/// and Algorithms for the Construction and Analysis of Systems
|
|
/// (TACAS'04)},
|
|
/// editor = {Kurt Jensen and Andreas Podelski},
|
|
/// pages = {205--219},
|
|
/// year = {2004},
|
|
/// publisher = {Springer-Verlag},
|
|
/// series = {Lecture Notes in Computer Science},
|
|
/// volume = {2988},
|
|
/// isbn = {3-540-21299-X}
|
|
/// }
|
|
/// \endverbatim
|
|
emptiness_check* explicit_gv04_check(const tgba* a,
|
|
option_map o = option_map());
|
|
}
|
|
|
|
#endif // SPOT_TGBAALGOS_GV04_HH
|