Fix verbatim blocks of Doxygen comments.
* src/ltlast/formula.hh, src/ltlvisit/contain.hh, src/ltlvisit/randomltl.hh, src/ltlvisit/reduce.hh, src/ltlvisit/remove_x.hh, src/ltlvisit/simplify.hh, src/ltlvisit/snf.hh, src/misc/minato.hh, src/misc/optionmap.hh, src/saba/sabacomplementtgba.hh, src/taalgos/emptinessta.hh, src/taalgos/minimize.hh, src/taalgos/tgba2ta.hh, src/tgba/tgbakvcomplement.hh, src/tgbaalgos/cycles.hh, src/tgbaalgos/eltl2tgba_lacim.hh, src/tgbaalgos/gtec/gtec.hh, src/tgbaalgos/gv04.hh, src/tgbaalgos/ltl2taa.hh, src/tgbaalgos/ltl2tgba_fm.hh, src/tgbaalgos/ltl2tgba_lacim.hh, src/tgbaalgos/magic.hh, src/tgbaalgos/minimize.hh, src/tgbaalgos/randomgraph.hh, src/tgbaalgos/se05.hh, src/tgbaalgos/simulation.hh, src/tgbaalgos/tau03.hh, src/tgbaalgos/tau03opt.hh: Surround verbatim blocks with /** ... */ instead of using /// on each line. Otherwise Doxygen will output the leading "///" tokens -- apparently this is a feature. * src/sanity/style.test: Strip multi-line comments before checking code style.
This commit is contained in:
parent
1ec9cebe58
commit
1cd9b204ed
29 changed files with 758 additions and 745 deletions
|
|
@ -50,19 +50,19 @@ namespace spot
|
|||
/// 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
|
||||
/** \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:
|
||||
|
|
|
|||
|
|
@ -38,22 +38,22 @@ namespace spot
|
|||
/// achieved using any algorithm based on partition refinement
|
||||
///
|
||||
/// For more detail about this type of algorithm, see the following paper:
|
||||
/// \verbatim
|
||||
/// @InProceedings{valmari.09.icatpn,
|
||||
/// author = {Antti Valmari},
|
||||
/// title = {Bisimilarity Minimization in in O(m logn) Time},
|
||||
/// booktitle = {Proceedings of the 30th International Conference on
|
||||
/// the Applications and Theory of Petri Nets
|
||||
/// (ICATPN'09)},
|
||||
/// series = {Lecture Notes in Computer Science},
|
||||
/// publisher = {Springer},
|
||||
/// isbn = {978-3-642-02423-8},
|
||||
/// pages = {123--142},
|
||||
/// volume = 5606,
|
||||
/// url = {http://dx.doi.org/10.1007/978-3-642-02424-5_9},
|
||||
/// year = {2009}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
@InProceedings{valmari.09.icatpn,
|
||||
author = {Antti Valmari},
|
||||
title = {Bisimilarity Minimization in in O(m logn) Time},
|
||||
booktitle = {Proceedings of the 30th International Conference on
|
||||
the Applications and Theory of Petri Nets
|
||||
(ICATPN'09)},
|
||||
series = {Lecture Notes in Computer Science},
|
||||
publisher = {Springer},
|
||||
isbn = {978-3-642-02423-8},
|
||||
pages = {123--142},
|
||||
volume = 5606,
|
||||
url = {http://dx.doi.org/10.1007/978-3-642-02424-5_9},
|
||||
year = {2009}
|
||||
}
|
||||
\endverbatim */
|
||||
///
|
||||
/// \param ta_ the TA automaton to convert into a simplified TA
|
||||
ta*
|
||||
|
|
|
|||
|
|
@ -30,19 +30,19 @@ namespace spot
|
|||
/// \brief Build a spot::ta_explicit* (TA) from an LTL formula.
|
||||
///
|
||||
/// 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
|
||||
/** \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 */
|
||||
///
|
||||
/// \param tgba_to_convert The TGBA automaton to convert into a TA automaton
|
||||
///
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue