a4a0cf3bb2
* src/misc/bareword.cc, src/misc/bareword.hh (is_spin_ap): New function. * src/ltlast/formula.cc, src/ltlast/formula.hh (is_spin_atomic_props): New method and boolean. * src/ltlast/atomic_prop.cc, src/ltlast/constant.cc: Update it. * src/ltltest/kind.test: Test it.
111 lines
3.6 KiB
C++
111 lines
3.6 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2015 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 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 "config.h"
|
|
#include "formula.hh"
|
|
#include "misc/hash.hh"
|
|
#include "misc/casts.hh"
|
|
#include <iostream>
|
|
#include "unop.hh"
|
|
#include "atomic_prop.hh"
|
|
#include <string.h>
|
|
|
|
namespace spot
|
|
{
|
|
namespace ltl
|
|
{
|
|
size_t formula::max_serial = 0;
|
|
|
|
#define printprops \
|
|
proprint(is_boolean, "B", "Boolean formula"); \
|
|
proprint(is_sugar_free_boolean, "&", "without Boolean sugar"); \
|
|
proprint(is_in_nenoform, "!", "in negative normal form"); \
|
|
proprint(is_syntactic_stutter_invariant, "x", \
|
|
"syntactic stutter invariant"); \
|
|
proprint(is_sugar_free_ltl, "f", "without LTL sugar"); \
|
|
proprint(is_ltl_formula, "L", "LTL formula"); \
|
|
proprint(is_eltl_formula, "E", "ELTL formula"); \
|
|
proprint(is_psl_formula, "P", "PSL formula"); \
|
|
proprint(is_sere_formula, "S", "SERE formula"); \
|
|
proprint(is_finite, "F", "finite"); \
|
|
proprint(is_eventual, "e", "pure eventuality"); \
|
|
proprint(is_universal, "u", "purely universal"); \
|
|
proprint(is_syntactic_safety, "s", "syntactic safety"); \
|
|
proprint(is_syntactic_guarantee, "g", "syntactic guarantee"); \
|
|
proprint(is_syntactic_obligation, "o", "syntactic obligation"); \
|
|
proprint(is_syntactic_persistence, "p", "syntactic persistence"); \
|
|
proprint(is_syntactic_recurrence, "r", "syntactic recurrence"); \
|
|
proprint(is_marked, "+", "marked"); \
|
|
proprint(accepts_eword, "0", "accepts the empty word"); \
|
|
proprint(has_lbt_atomic_props, "l", \
|
|
"has LBT-style atomic props"); \
|
|
proprint(has_spin_atomic_props, "a", \
|
|
"has Spin-style atomic props");
|
|
|
|
|
|
std::list<std::string>
|
|
list_formula_props(const formula* f)
|
|
{
|
|
std::list<std::string> res;
|
|
#define proprint(m, a, l) \
|
|
if (f->m()) \
|
|
res.emplace_back(l);
|
|
printprops;
|
|
#undef proprint
|
|
return res;
|
|
}
|
|
|
|
std::ostream&
|
|
print_formula_props(std::ostream& out, const formula* f, bool abbr)
|
|
{
|
|
const char* comma = abbr ? "" : ", ";
|
|
const char* sep = "";
|
|
|
|
#define proprint(m, a, l) \
|
|
if (f->m()) \
|
|
{ \
|
|
out << sep; out << (abbr ? a : l); \
|
|
sep = comma; \
|
|
}
|
|
printprops;
|
|
#undef proprint
|
|
|
|
return out;
|
|
}
|
|
|
|
const formula* get_literal(const formula* f)
|
|
{
|
|
const unop* g = is_Not(f);
|
|
if (g)
|
|
f = g->child();
|
|
return is_atomic_prop(f);
|
|
}
|
|
|
|
int atomic_prop_cmp(const formula* f, const formula* g)
|
|
{
|
|
const atomic_prop* a = down_cast<const atomic_prop*>(f);
|
|
const atomic_prop* b = down_cast<const atomic_prop*>(g);
|
|
return strverscmp(a->name().c_str(), b->name().c_str());
|
|
}
|
|
|
|
}
|
|
}
|