// -*- coding: utf-8 -*- // Copyright (C) 2010, 2012, 2013 Laboratoire de Recherche et // Développement de l'Epita (LRDE). // Copyright (C) 2004 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 . #ifndef SPOT_LTLVISIT_SIMPFG_HH # define SPOT_LTLVISIT_SIMPFG_HH #include "clone.hh" namespace spot { namespace ltl { /// \ingroup ltl_visitor /// \brief Replace true U f and false R g by /// F f and G g. /// /// Perform the following rewriting (from left to right): /// /// - true U a = F a /// - a M true = F a /// - false R a = G a /// - a W false = G a /// class SPOT_API simplify_f_g_visitor : public clone_visitor { typedef clone_visitor super; public: simplify_f_g_visitor(); virtual ~simplify_f_g_visitor(); using super::visit; void visit(const binop* bo); virtual const formula* recurse(const formula* f); }; /// \ingroup ltl_rewriting /// \brief Replace true U f and false R g by /// F f and G g. /// /// Perform the following rewriting (from left to right): /// /// - true U a = F a /// - a M true = F a /// - false R a = G a /// - a W false = G a /// SPOT_API const formula* simplify_f_g(const formula* f); } } #endif // SPOT_LTLVISIT_LUNABBREV_HH