df760a4597
These are safety, guarantee, obligation, persistence, and recurrence. * src/ltlast/formula.hh, src/ltlast/formula.cc: Declare a bit for each of these classes. * src/ltlast/atomic_prop.cc, src/ltlast/constant.cc, src/ltlast/automatop.cc, src/ltlast/binop.cc, src/ltlast/bunop.cc, src/ltlast/unop.cc: Update these bits. * src/ltltest/kind.test: Update tests and add more.
342 lines
8 KiB
C++
342 lines
8 KiB
C++
// Copyright (C) 2009, 2010, 2011 Laboratoire de Recherche et Développement
|
|
// de l'Epita (LRDE).
|
|
// Copyright (C) 2003, 2005 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 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.
|
|
|
|
#include "unop.hh"
|
|
#include "visitor.hh"
|
|
#include <cassert>
|
|
#include <iostream>
|
|
#include "constant.hh"
|
|
#include "atomic_prop.hh"
|
|
|
|
namespace spot
|
|
{
|
|
namespace ltl
|
|
{
|
|
unop::unop(type op, formula* child)
|
|
: ref_formula(UnOp), op_(op), child_(child)
|
|
{
|
|
props = child->get_props();
|
|
switch (op)
|
|
{
|
|
case Not:
|
|
is.in_nenoform = (child->kind() == AtomicProp);
|
|
is.sere_formula = is.boolean;
|
|
|
|
is.syntactic_safety = child->is_syntactic_guarantee();
|
|
is.syntactic_guarantee = child->is_syntactic_safety();
|
|
// is.syntactic_obligation inherited from child
|
|
is.syntactic_recurrence = child->is_syntactic_persistence();
|
|
is.syntactic_persistence = child->is_syntactic_recurrence();
|
|
|
|
is.accepting_eword = false;
|
|
break;
|
|
case X:
|
|
is.boolean = false;
|
|
is.X_free = false;
|
|
is.eltl_formula = false;
|
|
is.sere_formula = false;
|
|
// is.syntactic_safety inherited
|
|
// is.syntactic_guarantee inherited
|
|
// is.syntactic_obligation inherited
|
|
// is.syntactic_recurrence inherited
|
|
// is.syntactic_persistence inherited
|
|
is.accepting_eword = false;
|
|
break;
|
|
case F:
|
|
is.boolean = false;
|
|
is.eltl_formula = false;
|
|
is.sere_formula = false;
|
|
is.sugar_free_ltl = false;
|
|
is.eventual = true;
|
|
is.syntactic_safety = false;
|
|
// is.syntactic_guarantee inherited
|
|
is.syntactic_obligation = is.syntactic_guarantee;
|
|
is.syntactic_recurrence = is.syntactic_guarantee;
|
|
// is.syntactic_persistence inherited
|
|
is.accepting_eword = false;
|
|
break;
|
|
case G:
|
|
is.boolean = false;
|
|
is.eltl_formula = false;
|
|
is.sere_formula = false;
|
|
is.sugar_free_ltl = false;
|
|
is.universal = true;
|
|
// is.syntactic_safety inherited
|
|
is.syntactic_guarantee = false;
|
|
is.syntactic_obligation = is.syntactic_safety;
|
|
// is.syntactic_recurrence inherited
|
|
is.syntactic_persistence = is.syntactic_safety;
|
|
is.accepting_eword = false;
|
|
break;
|
|
case Finish:
|
|
is.boolean = false;
|
|
is.ltl_formula = false;
|
|
is.psl_formula = false;
|
|
is.sere_formula = false;
|
|
is.syntactic_safety = false;
|
|
is.syntactic_guarantee = false;
|
|
is.syntactic_obligation = false;
|
|
is.syntactic_recurrence = false;
|
|
is.syntactic_persistence = false;
|
|
is.accepting_eword = false;
|
|
break;
|
|
case NegClosure:
|
|
is.not_marked = false;
|
|
is.boolean = false;
|
|
is.ltl_formula = false;
|
|
is.eltl_formula = false;
|
|
is.psl_formula = true;
|
|
is.sere_formula = false;
|
|
is.syntactic_safety = true;
|
|
is.syntactic_guarantee = true;
|
|
is.syntactic_obligation = true;
|
|
is.syntactic_recurrence = true;
|
|
is.syntactic_persistence = true;
|
|
is.accepting_eword = false;
|
|
break;
|
|
case Closure:
|
|
is.boolean = false;
|
|
is.ltl_formula = false;
|
|
is.eltl_formula = false;
|
|
is.psl_formula = true;
|
|
is.sere_formula = false;
|
|
is.syntactic_safety = true;
|
|
is.syntactic_guarantee = true;
|
|
is.syntactic_obligation = true;
|
|
is.syntactic_recurrence = true;
|
|
is.syntactic_persistence = true;
|
|
is.accepting_eword = false;
|
|
assert(child->is_sere_formula());
|
|
break;
|
|
}
|
|
}
|
|
|
|
unop::~unop()
|
|
{
|
|
// Get this instance out of the instance map.
|
|
pair p(op(), child());
|
|
map::iterator i = instances.find(p);
|
|
assert (i != instances.end());
|
|
instances.erase(i);
|
|
|
|
// Dereference child.
|
|
child()->destroy();
|
|
}
|
|
|
|
std::string
|
|
unop::dump() const
|
|
{
|
|
return std::string("unop(") + op_name() + ", " + child()->dump() + ")";
|
|
}
|
|
|
|
void
|
|
unop::accept(visitor& v)
|
|
{
|
|
v.visit(this);
|
|
}
|
|
|
|
void
|
|
unop::accept(const_visitor& v) const
|
|
{
|
|
v.visit(this);
|
|
}
|
|
|
|
const formula*
|
|
unop::child() const
|
|
{
|
|
return child_;
|
|
}
|
|
|
|
formula*
|
|
unop::child()
|
|
{
|
|
return child_;
|
|
}
|
|
|
|
unop::type
|
|
unop::op() const
|
|
{
|
|
return op_;
|
|
}
|
|
|
|
const char*
|
|
unop::op_name() const
|
|
{
|
|
switch (op_)
|
|
{
|
|
case Not:
|
|
return "Not";
|
|
case X:
|
|
return "X";
|
|
case F:
|
|
return "F";
|
|
case G:
|
|
return "G";
|
|
case Finish:
|
|
return "Finish";
|
|
case Closure:
|
|
return "Closure";
|
|
case NegClosure:
|
|
return "NegClosure";
|
|
}
|
|
// Unreachable code.
|
|
assert(0);
|
|
return 0;
|
|
}
|
|
|
|
unop::map unop::instances;
|
|
|
|
formula*
|
|
unop::instance(type op, formula* child)
|
|
{
|
|
|
|
// Some trivial simplifications.
|
|
switch (op)
|
|
{
|
|
case F:
|
|
case G:
|
|
{
|
|
if (child->kind() == UnOp)
|
|
{
|
|
// F and G are idempotent.
|
|
unop* u = static_cast<unop*>(child);
|
|
if (u->op() == op)
|
|
return u;
|
|
}
|
|
|
|
// F(0) = G(0) = 0
|
|
// F(1) = G(1) = 1
|
|
if (child == constant::false_instance()
|
|
|| child == constant::true_instance())
|
|
return child;
|
|
|
|
assert(child != constant::empty_word_instance());
|
|
}
|
|
break;
|
|
|
|
case Not:
|
|
{
|
|
// !1 = 0
|
|
if (child == constant::true_instance())
|
|
return constant::false_instance();
|
|
// !0 = 1
|
|
if (child == constant::false_instance())
|
|
return constant::true_instance();
|
|
// ![*0] = 1[+]
|
|
if (child == constant::empty_word_instance())
|
|
return bunop::instance(bunop::Star,
|
|
constant::true_instance(), 1);
|
|
|
|
if (child->kind() == UnOp)
|
|
{
|
|
unop* u = static_cast<unop*>(child);
|
|
// "Not" is an involution.
|
|
if (u->op() == op)
|
|
{
|
|
formula* c = u->child()->clone();
|
|
u->destroy();
|
|
return c;
|
|
}
|
|
// !Closure(Exp) = NegClosure(Exp)
|
|
if (u->op() == Closure)
|
|
{
|
|
formula* c = unop::instance(NegClosure,
|
|
u->child()->clone());
|
|
u->destroy();
|
|
return c;
|
|
}
|
|
// !NegClosure(Exp) = Closure(Exp)
|
|
if (u->op() == NegClosure)
|
|
{
|
|
formula* c = unop::instance(Closure,
|
|
u->child()->clone());
|
|
u->destroy();
|
|
return c;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
|
|
case X:
|
|
// X(1) = 1, X(0) = 0
|
|
if (child == constant::true_instance()
|
|
|| child == constant::false_instance())
|
|
return child;
|
|
assert(child != constant::empty_word_instance());
|
|
break;
|
|
|
|
case Finish:
|
|
// No simplifications for Finish.
|
|
break;
|
|
|
|
case Closure:
|
|
if (child == constant::true_instance()
|
|
|| child == constant::empty_word_instance())
|
|
return constant::true_instance();
|
|
if (child == constant::false_instance())
|
|
return child;
|
|
break;
|
|
|
|
case NegClosure:
|
|
if (child == constant::true_instance()
|
|
|| child == constant::empty_word_instance())
|
|
return constant::false_instance();
|
|
if (child == constant::false_instance())
|
|
return constant::true_instance();
|
|
break;
|
|
}
|
|
|
|
pair p(op, child);
|
|
map::iterator i = instances.find(p);
|
|
if (i != instances.end())
|
|
{
|
|
// This instance already exists.
|
|
child->destroy();
|
|
return static_cast<unop*>(i->second->clone());
|
|
}
|
|
unop* ap = new unop(op, child);
|
|
instances[p] = ap;
|
|
return static_cast<unop*>(ap->clone());
|
|
}
|
|
|
|
unsigned
|
|
unop::instance_count()
|
|
{
|
|
return instances.size();
|
|
}
|
|
|
|
std::ostream&
|
|
unop::dump_instances(std::ostream& os)
|
|
{
|
|
for (map::iterator i = instances.begin(); i != instances.end(); ++i)
|
|
{
|
|
os << i->second << " = "
|
|
<< i->second->ref_count_() << " * "
|
|
<< i->second->dump()
|
|
<< std::endl;
|
|
}
|
|
return os;
|
|
}
|
|
|
|
}
|
|
}
|