alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

hierarchy: Make is_recurrence() public

Browse source 
* NEWS: Declare it.
* spot/tl/hierarchy.cc: Remove static keyword and anonymous namespace.
* spot/tl/hierarchy.hh: Declare function.
This commit is contained in:
Alexandre GBAGUIDI AISSE 2017-07-28 10:57:25 +02:00
parent 8cf542644c
commit e59274b609
3 changed files with 30 additions and 23 deletions
Download patch file Download diff file Expand all files Collapse all files

3
NEWS
View file

@ -51,6 +51,9 @@ New in spot 2.4.0.dev (not yet released)
recognize more if the original language can not be expressed with recognize more if the original language can not be expressed with
a co-Büchi acceptance condition. a co-Büchi acceptance condition.
- The function spot::is_recurrence() is now public. It checks if a formula
has the reccurence property.
Deprecation notices: Deprecation notices:
(These functions still work but compilers emit warnings.) (These functions still work but compilers emit warnings.)

9
spot/tl/hierarchy.cc
View file

@ -30,9 +30,8 @@
namespace spot namespace spot
{ {
namespace bool
{ is_recurrence(formula f, const twa_graph_ptr& aut)
static bool is_recurrence(formula f, const twa_graph_ptr& aut)
{ {
if (f.is_syntactic_recurrence() || is_universal(aut)) if (f.is_syntactic_recurrence() || is_universal(aut))
return true; return true;
@ -41,7 +40,8 @@ namespace spot
// BA will preserve determinism if possible. // BA will preserve determinism if possible.
spot::postprocessor p; spot::postprocessor p;
p.set_type(spot::postprocessor::Generic); p.set_type(spot::postprocessor::Generic);
p.set_pref(spot::postprocessor::Deterministic); p.set_pref(spot::postprocessor::Deterministic
| spot::postprocessor::SBAcc);
p.set_level(spot::postprocessor::Low); p.set_level(spot::postprocessor::Low);
auto dra = p.run(aut); auto dra = p.run(aut);
if (dra->acc().is_generalized_buchi()) if (dra->acc().is_generalized_buchi())
@ -55,7 +55,6 @@ namespace spot
return is_deterministic(ba); return is_deterministic(ba);
} }
} }
}
char mp_class(formula f) char mp_class(formula f)
{ {

5
spot/tl/hierarchy.hh
View file

@ -20,9 +20,14 @@
#pragma once #pragma once
#include <spot/tl/formula.hh> #include <spot/tl/formula.hh>
#include <spot/twa/fwd.hh>
namespace spot namespace spot
{ {
/// \brief Return true if the formula has the recurrence property.
SPOT_API
bool is_recurrence(formula f, const twa_graph_ptr& aut);
/// \brief Return the class of \a f in the temporal hierarchy of Manna /// \brief Return the class of \a f in the temporal hierarchy of Manna
/// and Pnueli (PODC'90). /// and Pnueli (PODC'90).
/// ///