ltl2tgba_fm.hh 4.32 KB
Newer Older
1
// Copyright (C) 2003, 2004, 2005  Laboratoire d'Informatique de Paris 6 (LIP6),
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// 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
#ifndef SPOT_TGBAALGOS_LTL2TGBA_FM_HH
# define SPOT_TGBAALGOS_LTL2TGBA_FM_HH
24
25
26

#include "ltlast/formula.hh"
#include "tgba/tgbaexplicit.hh"
27
#include "ltlvisit/apcollect.hh"
28
29
30
31

namespace spot
{
  /// \brief Build a spot::tgba_explicit* from an LTL formula.
32
  /// \ingroup tgba_ltl
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
  ///
  /// This is based on the following paper.
  /// \verbatim
  /// @InProceedings{couvreur.99.fm,
  ///   author	  = {Jean-Michel Couvreur},
  ///   title     = {On-the-fly Verification of Temporal Logic},
  ///   pages     = {253--271},
  ///   editor	  = {Jeannette M. Wing and Jim Woodcock and Jim Davies},
  ///   booktitle = {Proceedings of the World Congress on Formal Methods in the
  /// 		     Development of Computing Systems (FM'99)},
  ///   publisher = {Springer-Verlag},
  ///   series	  = {Lecture Notes in Computer Science},
  ///   volume	  = {1708},
  ///   year      = {1999},
  ///   address	  = {Toulouse, France},
  ///   month	  = {September},
  ///   isbn      = {3-540-66587-0}
  /// }
51
  /// \endverbatim
52
  ///
53
  /// \param f The formula to translate into an automaton.
54
55
56
57
  ///
  /// \param dict The spot::bdd_dict the constructed automata should use.
  ///
  /// \param exprop When set, the algorithm will consider all properties
58
  /// combinations possible on each state, in an attempt to reduce
59
60
  /// the non-determinism.  The automaton will have the same size as
  /// without this option, but because the transition will be more
61
62
  /// deterministic, the product automaton will be smaller (or, at worse,
  /// equal).
63
  ///
64
  /// \param symb_merge When false, states with the same symbolic
65
66
  /// representation (these are equivalent formulae) will not be
  /// merged.
67
  ///
68
  /// \param branching_postponement When set, several transitions leaving
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
  /// from the same state with the same label (i.e., condition + acceptance
  /// conditions) will be merged.  This correspond to an optimization
  /// described in the following paper.
  /// \verbatim
  /// @InProceedings{	  sebastiani.03.charme,
  ///   author	  = {Roberto Sebastiani and Stefano Tonetta},
  ///   title	  = {"More Deterministic" vs. "Smaller" B{\"u}chi Automata for
  /// 		     Efficient LTL Model Checking},
  ///   booktitle = {Proceedings for the 12th Advanced Research Working
  /// 		     Conference on Correct Hardware Design and Verification
  /// 		     Methods (CHARME'03)},
  ///   pages     = {126--140},
  ///   year      = {2003},
  ///   editor	  = {G. Goos and J. Hartmanis and J. van Leeuwen},
  ///   volume	  = {2860},
  ///   series	  = {Lectures Notes in Computer Science},
  ///   month     = {October},
  ///   publisher = {Springer-Verlag}
  /// }
88
  /// \endverbatim
89
  ///
90
  /// \param fair_loop_approx When set, a really simple characterization of
91
92
  /// unstable state is used to suppress all acceptance conditions from
  /// incoming transitions.
93
  ///
94
95
96
97
  /// \param unobs When non-zero, the atomic propositions in the LTL formula
  /// are interpreted as events that exclude each other.  The events in the
  /// formula are observable events, and \c unobs can be filled with
  /// additional unobservable events.
98
  /// \return A spot::tgba_explicit that recognizes the language of \a f.
99
  tgba_explicit* ltl_to_tgba_fm(const ltl::formula* f, bdd_dict* dict,
100
				bool exprop = false, bool symb_merge = true,
101
				bool branching_postponement = false,
102
103
				bool fair_loop_approx = false,
				const ltl::atomic_prop_set* unobs = 0);
104
105
}

106
#endif // SPOT_TGBAALGOS_LTL2TGBA_FM_HH