2beacc3924
* src/misc/common.hh (SPOT_UNIMPLEMENTED, SPOT_UNREACHABLE, SPOT_UNREACHABLE_BUILTIN): New macros. * src/bin/dstar2tgba.cc, src/bin/ltlcross.cc, src/dstarparse/dstar2tgba.cc, src/eltlparse/eltlparse.yy, src/ltlast/binop.cc, src/ltlast/bunop.cc, src/ltlast/constant.cc, src/ltlast/formula_tree.cc, src/ltlast/multop.cc, src/ltlast/nfa.cc, src/ltlast/unop.cc, src/ltlvisit/dotty.cc, src/ltlvisit/lbt.cc, src/ltlvisit/lunabbrev.cc, src/ltlvisit/mark.cc, src/ltlvisit/randomltl.cc, src/ltlvisit/simpfg.cc, src/ltlvisit/simplify.cc, src/ltlvisit/snf.cc, src/ltlvisit/tostring.cc, src/misc/intvcomp.cc, src/misc/minato.cc, src/tgba/bdddict.cc, src/tgba/formula2bdd.cc, src/tgba/tgbasafracomplement.cc, src/tgbaalgos/eltl2tgba_lacim.cc, src/tgbaalgos/ltl2taa.cc, src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/ltl2tgba_lacim.cc, src/tgbaalgos/simulation.cc, src/tgbatest/ltl2tgba.cc: Use them. * src/sanity/style.test: Catch assert(0) and assert(!"text");
106 lines
2.7 KiB
C++
106 lines
2.7 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2010, 2012, 2014 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 <http://www.gnu.org/licenses/>.
|
|
|
|
#include "ltlast/allnodes.hh"
|
|
#include "ltlvisit/clone.hh"
|
|
#include "simpfg.hh"
|
|
#include <cassert>
|
|
|
|
namespace spot
|
|
{
|
|
namespace ltl
|
|
{
|
|
|
|
simplify_f_g_visitor::simplify_f_g_visitor()
|
|
{
|
|
}
|
|
|
|
simplify_f_g_visitor::~simplify_f_g_visitor()
|
|
{
|
|
}
|
|
|
|
void
|
|
simplify_f_g_visitor::visit(const binop* bo)
|
|
{
|
|
const formula* f1 = recurse(bo->first());
|
|
const formula* f2 = recurse(bo->second());
|
|
binop::type op = bo->op();
|
|
|
|
switch (op)
|
|
{
|
|
case binop::Xor:
|
|
case binop::Implies:
|
|
case binop::Equiv:
|
|
case binop::UConcat:
|
|
case binop::EConcat:
|
|
case binop::EConcatMarked:
|
|
result_ = binop::instance(op, f1, f2);
|
|
return;
|
|
/* true U f2 == F(f2) */
|
|
case binop::U:
|
|
if (f1 == constant::true_instance())
|
|
result_ = unop::instance(unop::F, f2);
|
|
else
|
|
result_ = binop::instance(binop::U, f1, f2);
|
|
return;
|
|
/* false R f2 == G(f2) */
|
|
case binop::R:
|
|
if (f1 == constant::false_instance())
|
|
result_ = unop::instance(unop::G, f2);
|
|
else
|
|
result_ = binop::instance(binop::R, f1, f2);
|
|
return;
|
|
/* f1 W false == G(f1) */
|
|
case binop::W:
|
|
if (f2 == constant::false_instance())
|
|
result_ = unop::instance(unop::G, f1);
|
|
else
|
|
result_ = binop::instance(binop::W, f1, f2);
|
|
return;
|
|
/* f1 M true == F(f1) */
|
|
case binop::M:
|
|
if (f2 == constant::true_instance())
|
|
result_ = unop::instance(unop::F, f1);
|
|
else
|
|
result_ = binop::instance(binop::M, f1, f2);
|
|
return;
|
|
}
|
|
SPOT_UNREACHABLE();
|
|
}
|
|
|
|
const formula*
|
|
simplify_f_g_visitor::recurse(const formula* f)
|
|
{
|
|
return simplify_f_g(f);
|
|
}
|
|
|
|
const formula*
|
|
simplify_f_g(const formula* f)
|
|
{
|
|
if (f->is_boolean())
|
|
return f->clone();
|
|
simplify_f_g_visitor v;
|
|
f->accept(v);
|
|
return v.result();
|
|
}
|
|
}
|
|
}
|