c5842c3a0a
* src/bin/randaut.cc, src/bin/man/randaut.x: New files. * src/bin/Makefile.am, src/bin/man/Makefile.am: Adjust. * src/tgbaalgos/randomgraph.hh, src/tgbaalgos/randomgraph.cc: Add an option to output state-based acceptance, and update the TGBA properties. * src/tgbatest/randaut.test: New test. * src/tgbatest/Makefile.am: Add it.
87 lines
3.9 KiB
C++
87 lines
3.9 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2011, 2013, 2014 Laboratoire de Recherche et
|
|
// Développement de l'Epita (LRDE).
|
|
// 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 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_RANDOMGRAPH_HH
|
|
# define SPOT_TGBAALGOS_RANDOMGRAPH_HH
|
|
|
|
#include "ltlvisit/apcollect.hh"
|
|
#include "ltlenv/defaultenv.hh"
|
|
#include "tgba/bdddict.hh"
|
|
|
|
namespace spot
|
|
{
|
|
/// \ingroup tgba_misc
|
|
/// \brief Construct a tgba randomly.
|
|
///
|
|
/// \param n The number of states wanted in the automata (>0). All states
|
|
/// will be connected, and there will be no dead state.
|
|
/// \param d The density of the automata. This is the probability
|
|
/// (between 0.0 and 1.0), to add a transition between two
|
|
/// states. All states have at least one outgoing transition,
|
|
/// so \a d is considered only when adding the remaining transition.
|
|
/// A density of 1 means all states will be connected to each other.
|
|
/// \param ap The list of atomic property that should label the transition.
|
|
/// \param dict The bdd_dict to used for this automata.
|
|
/// \param n_accs The number of acceptance sets to use.
|
|
/// If this number is non null, then there is no guarantee
|
|
/// that the generated graph contains an accepting cycle (raise
|
|
/// the value of \a a to improve the chances).
|
|
/// \param a The probability (between 0.0 and 1.0) that a transition belongs
|
|
/// to an acceptance set.
|
|
/// \param t The probability (between 0.0 and 1.0) that an atomic proposition
|
|
/// is true.
|
|
/// \param deterministic build a complete and deterministic automaton
|
|
/// \param state_acc build an automaton with state-based acceptance
|
|
///
|
|
/// This algorithms is adapted from the one in Fig 6.2 page 48 of
|
|
/** \verbatim
|
|
@TechReport{ tauriainen.00.a66,
|
|
author = {Heikki Tauriainen},
|
|
title = {Automated Testing of {B\"u}chi Automata Translators for
|
|
{L}inear {T}emporal {L}ogic},
|
|
address = {Espoo, Finland},
|
|
institution = {Helsinki University of Technology, Laboratory for
|
|
Theoretical Computer Science},
|
|
number = {A66},
|
|
year = {2000},
|
|
url = {http://citeseer.nj.nec.com/tauriainen00automated.html},
|
|
type = {Research Report},
|
|
note = {Reprint of Master's thesis}
|
|
}
|
|
\endverbatim */
|
|
///
|
|
/// Although the intent is similar, there are some differences
|
|
/// between the above published algorithm and this implementation.
|
|
/// First labels are on transitions, and acceptance conditions are
|
|
/// generated too. Second, the number of successors of a node is
|
|
/// chosen in \f$[1,n]\f$ following a normal distribution with mean
|
|
/// \f$1+(n-1)d\f$ and variance \f$(n-1)d(1-d)\f$. (This is less
|
|
/// accurate, but faster than considering all possible \a n
|
|
/// successors one by one.)
|
|
SPOT_API tgba_digraph_ptr
|
|
random_graph(int n, float d,
|
|
const ltl::atomic_prop_set* ap, const bdd_dict_ptr& dict,
|
|
unsigned n_accs = 0, float a = 0.1, float t = 0.5,
|
|
bool deterministic = false, bool state_acc = false);
|
|
}
|
|
|
|
#endif // SPOT_TGBAALGOS_RANDOMGRAPH_HH
|