Commit e59274b6 authored by Alexandre GBAGUIDI AISSE's avatar Alexandre GBAGUIDI AISSE
Browse files

hierarchy: Make is_recurrence() public

* NEWS: Declare it.
* spot/tl/ Remove static keyword and anonymous namespace.
* spot/tl/hierarchy.hh: Declare function.
parent 8cf54264
......@@ -51,6 +51,9 @@ New in spot (not yet released)
recognize more if the original language can not be expressed with
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:
(These functions still work but compilers emit warnings.)
......@@ -30,9 +30,8 @@
namespace spot
static bool is_recurrence(formula f, const twa_graph_ptr& aut)
is_recurrence(formula f, const twa_graph_ptr& aut)
if (f.is_syntactic_recurrence() || is_universal(aut))
return true;
......@@ -41,7 +40,8 @@ namespace spot
// BA will preserve determinism if possible.
spot::postprocessor p;
| spot::postprocessor::SBAcc);
auto dra =;
if (dra->acc().is_generalized_buchi())
......@@ -55,7 +55,6 @@ namespace spot
return is_deterministic(ba);
char mp_class(formula f)
......@@ -20,9 +20,14 @@
#pragma once
#include <spot/tl/formula.hh>
#include <spot/twa/fwd.hh>
namespace spot
/// \brief Return true if the formula has the recurrence property.
bool is_recurrence(formula f, const twa_graph_ptr& aut);
/// \brief Return the class of \a f in the temporal hierarchy of Manna
/// and Pnueli (PODC'90).
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment