lbtt.hh 2.17 KB
Newer Older
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// Copyright (C) 2003  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.

22
23
24
25
26
27
28
29
30
31
32
33
#ifndef SPOT_TGBAALGOS_LBTT_HH
# define SPOT_TGBAALGOS_LBTT_HH

#include "tgba/tgba.hh"
#include <iostream>

namespace spot
{
  /// \brief Print reachable states in LBTT format.
  ///
  /// Note that LBTT expects an automaton with transition
  /// labeled by propositional formulae, and generalized
Alexandre Duret-Lutz's avatar
typo    
Alexandre Duret-Lutz committed
34
  /// Büchi accepting conditions on \b states.  This
35
  /// is unlike our spot::tgba automata which put
36
  /// both generalized accepting conditions and propositional
Alexandre Duret-Lutz's avatar
typo    
Alexandre Duret-Lutz committed
37
  /// formulae) on \b transitions.
38
  ///
39
40
41
42
43
44
45
46
47
48
  /// This algorithm will therefore produce an automata where
  /// accepting conditions have been moved from each transition to
  /// previous state.  In the worst case, doing so will multiply the
  /// number of states and transitions of the automata by
  /// <code>2^|Acc|</code>.  where <code>|Acc|</code> is the number of
  /// accepting conditions used by the automata.  (It can be a bit
  /// more because LBTT allows only for one initial state:
  /// lbtt_reachable() may also have to create an additional state in
  /// case the source initial state had to be split.)  You have been
  /// warned.
49
50
51
  ///
  /// \param g The automata to print.
  /// \param os Where to print.
52
  std::ostream& lbtt_reachable(std::ostream& os, const tgba* g);
53
54
55
}

#endif // SPOT_TGBAALGOS_LBTT_HH