Create the direct simulation.
* src/tgbaalgos/simulation.cc, src/tgbaalgos/simulation.hh: New files. * src/tgbaalgos/Makefile.am: Add the new files to the compilation. * src/tgbatest/spotlbtt.test: Add the simulation. * src/tgbatest/ltl2tgba.cc: Add direct simulation (-RSD).
This commit is contained in:
parent
e75ad57446
commit
876f8c90a2
5 changed files with 773 additions and 1 deletions
67
src/tgbaalgos/simulation.hh
Normal file
67
src/tgbaalgos/simulation.hh
Normal file
|
|
@ -0,0 +1,67 @@
|
|||
// -*- coding: utf-8 -*-
|
||||
// Copyright (C) 2012 Laboratoire de Recherche et Développement
|
||||
// de l'Epita (LRDE).
|
||||
//
|
||||
// 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.
|
||||
|
||||
#ifndef SPOT_TGBAALGOS_SIMULATION_HH
|
||||
# define SPOT_TGBAALGOS_SIMULATION_HH
|
||||
|
||||
|
||||
namespace spot
|
||||
{
|
||||
class tgba;
|
||||
|
||||
/// \addtogroup tgba_reduction
|
||||
/// @{
|
||||
|
||||
/// \brief Tries to reduce the automaton by merging states whose
|
||||
/// recognizes similar language.
|
||||
///
|
||||
/// When the language recognized by one state is included in the
|
||||
/// language recognized by an another one, the first one is merged
|
||||
/// with the second. The algorithm is based on the following
|
||||
/// paper:
|
||||
///
|
||||
/// \verbatim
|
||||
/// @InProceedings{ etessami.00.concur,
|
||||
/// author = {Kousha Etessami and Gerard J. Holzmann},
|
||||
/// title = {Optimizing {B\"u}chi Automata},
|
||||
/// booktitle = {Proceedings of the 11th International Conference on
|
||||
/// Concurrency Theory (Concur'00)},
|
||||
/// pages = {153--167},
|
||||
/// year = {2000},
|
||||
/// editor = {C. Palamidessi},
|
||||
/// volume = {1877},
|
||||
/// series = {Lecture Notes in Computer Science},
|
||||
/// address = {Pennsylvania, USA},
|
||||
/// publisher = {Springer-Verlag}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
///
|
||||
/// \param automaton The automaton to simulate.
|
||||
/// \return a new automaton which is at worst a copy of the received
|
||||
/// one.
|
||||
tgba* simulation(const tgba* automaton);
|
||||
|
||||
/// @}
|
||||
} // End namespace spot.
|
||||
|
||||
|
||||
|
||||
#endif // !SPOT_TGBAALGOS_SIMULATION_HH
|
||||
Loading…
Add table
Add a link
Reference in a new issue