ltl: rename is_X_free() into is_syntactic_stutter_invariant()
and adjust it to detect siPSL formulas, as in the paper of Dax et al. (ATVA'09). For issue #51. * src/ltlast/atomic_prop.cc, src/ltlast/binop.cc, src/ltlast/bunop.cc, src/ltlast/constant.cc, src/ltlast/formula.cc, src/ltlast/formula.hh, src/ltlast/multop.cc, src/ltlast/unop.cc: Rename the property, and adjust its computation on siSERE. * src/ltlvisit/remove_x.cc, src/ltlvisit/simplify.cc, src/tgbaalgos/stutter.cc: Adjust to new names. * src/bin/ltlfilt.cc: Add option --syntactic-sutter-invariant. * src/ltltest/kind.test: Update tests and add some new.
This commit is contained in:
parent
a79db4eefe
commit
34f1601b9b
13 changed files with 185 additions and 86 deletions
|
|
@ -57,14 +57,28 @@ namespace spot
|
|||
{
|
||||
case Star:
|
||||
if (max_ == unbounded)
|
||||
is.finite = false;
|
||||
{
|
||||
is.finite = false;
|
||||
is.syntactic_si = min_ == 1 && child->is_boolean();
|
||||
}
|
||||
else
|
||||
{
|
||||
is.syntactic_si = false;
|
||||
}
|
||||
if (min_ == 0)
|
||||
is.accepting_eword = true;
|
||||
break;
|
||||
case FStar:
|
||||
is.accepting_eword = false;
|
||||
if (max_ == unbounded)
|
||||
is.finite = false;
|
||||
{
|
||||
is.finite = false;
|
||||
is.syntactic_si &= !child->is_boolean();
|
||||
}
|
||||
else
|
||||
{
|
||||
is.syntactic_si = false;
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue