rename src/ as spot/ and use include <spot/...>
* NEWS: Mention the change. * src/: Rename as ... * spot/: ... this, adjust all headers to include <spot/...> instead of "...", and adjust all Makefile.am to search headers from the top-level directory. * HACKING: Add conventions about #include. * spot/sanity/style.test: Add a few more grep to catch cases that do not follow these conventions. * .gitignore, Makefile.am, README, bench/stutter/Makefile.am, bench/stutter/stutter_invariance_formulas.cc, bench/stutter/stutter_invariance_randomgraph.cc, configure.ac, debian/rules, doc/Doxyfile.in, doc/Makefile.am, doc/org/.dir-locals.el.in, doc/org/g++wrap.in, doc/org/init.el.in, doc/org/tut01.org, doc/org/tut02.org, doc/org/tut03.org, doc/org/tut10.org, doc/org/tut20.org, doc/org/tut21.org, doc/org/tut22.org, doc/org/tut30.org, iface/ltsmin/Makefile.am, iface/ltsmin/kripke.test, iface/ltsmin/ltsmin.cc, iface/ltsmin/ltsmin.hh, iface/ltsmin/modelcheck.cc, wrap/python/Makefile.am, wrap/python/ajax/spotcgi.in, wrap/python/spot_impl.i, wrap/python/tests/ltl2tgba.py, wrap/python/tests/randgen.py, wrap/python/tests/run.in: Adjust.
This commit is contained in:
Alexandre Duret-Lutz
parent
1fddfe60ec
commit
f120dd3206
529 changed files with 1308 additions and 1262 deletions
162
spot/taalgos/emptinessta.hh
Normal file
162
spot/taalgos/emptinessta.hh
Normal file
|
|
@ -0,0 +1,162 @@
|
|||
// -*- coding: utf-8 -*-
|
||||
// Copyright (C) 2008, 2012, 2013, 2014 Laboratoire de Recherche et
|
||||
// Dévelopment de l'Epita (LRDE).
|
||||
// Copyright (C) 2003, 2004, 2005, 2006 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 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/>.
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <spot/ta/taproduct.hh>
|
||||
#include <spot/misc/optionmap.hh>
|
||||
#include <spot/twaalgos/emptiness_stats.hh>
|
||||
#include <stack>
|
||||
#include <queue>
|
||||
|
||||
namespace spot
|
||||
{
|
||||
|
||||
namespace
|
||||
{
|
||||
typedef std::pair<const spot::state*,
|
||||
ta_succ_iterator_product*> pair_state_iter;
|
||||
}
|
||||
|
||||
/// \addtogroup ta_emptiness_check Emptiness-checks
|
||||
/// \ingroup ta_algorithms
|
||||
///
|
||||
/// \brief Check whether the language of a product (spot::ta_product) between
|
||||
/// a Kripke structure and a TA is empty. It works also for the product
|
||||
/// using Generalized TA (GTA and SGTA).
|
||||
///
|
||||
/// you should call spot::ta_check::check() to check the product automaton.
|
||||
/// If spot::ta_check::check() returns false, then the product automaton
|
||||
/// was found empty. Otherwise the automaton accepts some run.
|
||||
///
|
||||
/// This is based on the following paper.
|
||||
/** \verbatim
|
||||
@InProceedings{ geldenhuys.06.spin,
|
||||
author = {Jaco Geldenhuys and Henri Hansen},
|
||||
title = {Larger Automata and Less Work for {LTL} Model Checking},
|
||||
booktitle = {Proceedings of the 13th International SPIN Workshop
|
||||
(SPIN'06)},
|
||||
year = {2006},
|
||||
pages = {53--70},
|
||||
series = {Lecture Notes in Computer Science},
|
||||
volume = {3925},
|
||||
publisher = {Springer}
|
||||
}
|
||||
\endverbatim */
|
||||
///
|
||||
/// the implementation of spot::ta_check::check() is inspired from the
|
||||
/// two-pass algorithm of the paper above:
|
||||
/// - the fist-pass detect all Buchi-accepting cycles and includes
|
||||
/// the heuristic proposed in the paper to detect some
|
||||
/// livelock-accepting cycles.
|
||||
/// - the second-pass detect all livelock-accepting cycles.
|
||||
/// In addition, we add some optimizations to the fist pass:
|
||||
/// 1- Detection of all cycles containing a least
|
||||
/// one state that is both livelock and Buchi accepting states
|
||||
/// 2- Detection of all livelock-accepting cycles containing a least
|
||||
/// one state (k,t) such as its "TA component" t is a livelock-accepting
|
||||
/// state that has no successors in the TA automaton.
|
||||
///
|
||||
/// The implementation of the algorithm of each pass is a SCC-based algorithm
|
||||
/// inspired from spot::gtec.hh.
|
||||
/// @{
|
||||
|
||||
/// \brief An implementation of the emptiness-check algorithm for a product
|
||||
/// between a TA and a Kripke structure
|
||||
///
|
||||
/// See the paper cited above.
|
||||
class SPOT_API ta_check : public ec_statistics
|
||||
{
|
||||
typedef std::unordered_map<const state*, int,
|
||||
state_ptr_hash, state_ptr_equal> hash_type;
|
||||
public:
|
||||
ta_check(const const_ta_product_ptr& a, option_map o = option_map());
|
||||
virtual
|
||||
~ta_check();
|
||||
|
||||
/// \brief Check whether the TA product automaton contains an accepting run:
|
||||
/// it detects the two kinds of accepting runs: Buchi-accepting runs
|
||||
/// and livelock-accepting runs. This emptiness check algorithm can also
|
||||
/// check a product using the generalized form of TA.
|
||||
///
|
||||
/// Return false if the product automaton accepts no run, otherwise true
|
||||
///
|
||||
/// \param disable_second_pass is used to disable the second pass when
|
||||
/// when it is not necessary, for example when all the livelock-accepting
|
||||
/// states of the TA automaton have no successors, we call this kind of
|
||||
/// TA as STA (Single-pass Testing Automata)
|
||||
/// (see spot::tgba2ta::add_artificial_livelock_accepting_state() for an
|
||||
/// automatic transformation of any TA automaton into STA automaton
|
||||
///
|
||||
/// \param disable_heuristic_for_livelock_detection disable the heuristic
|
||||
/// used in the first pass to detect livelock-accepting runs,
|
||||
/// this heuristic is described in the paper cited above
|
||||
virtual bool
|
||||
check(bool disable_second_pass = false,
|
||||
bool disable_heuristic_for_livelock_detection = false);
|
||||
|
||||
/// \brief Check whether the product automaton contains
|
||||
/// a livelock-accepting run
|
||||
/// Return false if the product automaton accepts no livelock-accepting run,
|
||||
/// otherwise true
|
||||
virtual bool
|
||||
livelock_detection(const const_ta_product_ptr& t);
|
||||
|
||||
/// Print statistics, if any.
|
||||
virtual std::ostream&
|
||||
print_stats(std::ostream& os) const;
|
||||
|
||||
protected:
|
||||
void
|
||||
clear(hash_type& h, std::stack<pair_state_iter> todo, std::queue<
|
||||
const spot::state*> init_set);
|
||||
|
||||
void
|
||||
clear(hash_type& h, std::stack<pair_state_iter> todo,
|
||||
spot::ta_succ_iterator* init_states_it);
|
||||
|
||||
/// the heuristic for livelock-accepting runs detection, it's described
|
||||
/// in the paper cited above
|
||||
bool
|
||||
heuristic_livelock_detection(const state * stuttering_succ,
|
||||
hash_type& h, int h_livelock_root, std::set<const state*,
|
||||
state_ptr_less_than> liveset_curr);
|
||||
|
||||
const_ta_product_ptr a_; ///< The automaton.
|
||||
option_map o_; ///< The options
|
||||
|
||||
// Force the second pass
|
||||
bool is_full_2_pass_;
|
||||
|
||||
// scc: a stack of strongly connected components (SCC)
|
||||
scc_stack_ta scc;
|
||||
|
||||
// sscc: a stack of strongly stuttering-connected components (SSCC)
|
||||
scc_stack_ta sscc;
|
||||
|
||||
};
|
||||
|
||||
/// @}
|
||||
|
||||
/// \addtogroup ta_emptiness_check_algorithms Emptiness-check algorithms
|
||||
/// \ingroup ta_emptiness_check
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue