Fix typo automatons -> automata
* NEWS, spot/twaalgos/dualize.cc, spot/twaalgos/dualize.hh, spot/twaalgos/langmap.cc, spot/twaalgos/sum.hh, tests/python/streett_totgba.py: Fixes typo.
This commit is contained in:
parent
f0161618ca
commit
30a68d288b
6 changed files with 10 additions and 10 deletions
4
NEWS
4
NEWS
|
|
@ -39,7 +39,7 @@ New in spot 2.3.5.dev (not yet released)
|
||||||
families of automata or LTL formulas, used by genltl and genaut.
|
families of automata or LTL formulas, used by genltl and genaut.
|
||||||
|
|
||||||
- spot::sum() and spot::sum_and() implements the union and the
|
- spot::sum() and spot::sum_and() implements the union and the
|
||||||
intersection of two automatons by putting them side-by-side and
|
intersection of two automata by putting them side-by-side and
|
||||||
using non-deterministim or universal branching on the initial
|
using non-deterministim or universal branching on the initial
|
||||||
statae.
|
statae.
|
||||||
|
|
||||||
|
|
@ -130,7 +130,7 @@ New in spot 2.3.5.dev (not yet released)
|
||||||
to the removal of some acceptance sets.
|
to the removal of some acceptance sets.
|
||||||
|
|
||||||
- The function spot::streett_to_generalized_buchi() is now able to
|
- The function spot::streett_to_generalized_buchi() is now able to
|
||||||
work on automatons with Streett-like acceptance.
|
work on automata with Streett-like acceptance.
|
||||||
|
|
||||||
- spot::relabel_here() was used on automata to rename atomic
|
- spot::relabel_here() was used on automata to rename atomic
|
||||||
propositions, it can now replace atomic propositions by Boolean
|
propositions, it can now replace atomic propositions by Boolean
|
||||||
|
|
|
||||||
|
|
@ -343,7 +343,7 @@ namespace spot
|
||||||
true_state_ = res->new_state();
|
true_state_ = res->new_state();
|
||||||
}
|
}
|
||||||
// This case does not cover cmpl && !um.first
|
// This case does not cover cmpl && !um.first
|
||||||
// Due to previous test shortcutting automatons that accept all words.
|
// Due to previous test shortcutting automata that accept all words.
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
assert(um.first);
|
assert(um.first);
|
||||||
|
|
|
||||||
|
|
@ -35,7 +35,7 @@ namespace spot
|
||||||
/// be output as generalized co-Büchi.
|
/// be output as generalized co-Büchi.
|
||||||
///
|
///
|
||||||
/// Functions like to_generalized_buchi() or remove_fin() are frequently
|
/// Functions like to_generalized_buchi() or remove_fin() are frequently
|
||||||
/// called on existential automatons after dualize() to obtain an easier
|
/// called on existential automata after dualize() to obtain an easier
|
||||||
/// acceptance condition, but maybe at the cost of losing determinism.
|
/// acceptance condition, but maybe at the cost of losing determinism.
|
||||||
///
|
///
|
||||||
/// If the input automaton is deterministic, the output will be deterministic.
|
/// If the input automaton is deterministic, the output will be deterministic.
|
||||||
|
|
|
||||||
|
|
@ -40,7 +40,7 @@ namespace spot
|
||||||
std::vector<twa_graph_ptr> alt_init_st_auts(n_states);
|
std::vector<twa_graph_ptr> alt_init_st_auts(n_states);
|
||||||
std::vector<twa_graph_ptr> compl_alt_init_st_auts(n_states);
|
std::vector<twa_graph_ptr> compl_alt_init_st_auts(n_states);
|
||||||
|
|
||||||
// Prepare all automatons needed.
|
// Prepare all automata needed.
|
||||||
for (unsigned i = 0; i < n_states; ++i)
|
for (unsigned i = 0; i < n_states; ++i)
|
||||||
{
|
{
|
||||||
twa_graph_ptr c = make_twa_graph(aut, twa::prop_set::all());
|
twa_graph_ptr c = make_twa_graph(aut, twa::prop_set::all());
|
||||||
|
|
|
||||||
|
|
@ -25,7 +25,7 @@
|
||||||
namespace spot
|
namespace spot
|
||||||
{
|
{
|
||||||
/// \brief Sum two twa into a new twa, performing the union of the two input
|
/// \brief Sum two twa into a new twa, performing the union of the two input
|
||||||
/// automatons.
|
/// automata.
|
||||||
///
|
///
|
||||||
/// \param left Left term of the sum.
|
/// \param left Left term of the sum.
|
||||||
/// \param right Right term of the sum.
|
/// \param right Right term of the sum.
|
||||||
|
|
@ -35,7 +35,7 @@ namespace spot
|
||||||
const const_twa_graph_ptr& right);
|
const const_twa_graph_ptr& right);
|
||||||
|
|
||||||
/// \brief Sum two twa into a new twa, performing the union of the two input
|
/// \brief Sum two twa into a new twa, performing the union of the two input
|
||||||
/// automatons.
|
/// automata.
|
||||||
///
|
///
|
||||||
/// \param left Left term of the sum.
|
/// \param left Left term of the sum.
|
||||||
/// \param right Right term of the sum.
|
/// \param right Right term of the sum.
|
||||||
|
|
@ -49,7 +49,7 @@ namespace spot
|
||||||
unsigned right_state);
|
unsigned right_state);
|
||||||
|
|
||||||
/// \brief Sum two twa into a new twa, using a universal initial transition,
|
/// \brief Sum two twa into a new twa, using a universal initial transition,
|
||||||
/// performing the intersection of the two languages of the input automatons.
|
/// performing the intersection of the two languages of the input automata.
|
||||||
///
|
///
|
||||||
/// \param left Left term of the sum.
|
/// \param left Left term of the sum.
|
||||||
/// \param right Right term of the sum.
|
/// \param right Right term of the sum.
|
||||||
|
|
@ -59,7 +59,7 @@ namespace spot
|
||||||
const const_twa_graph_ptr& right);
|
const const_twa_graph_ptr& right);
|
||||||
|
|
||||||
/// \brief Sum two twa into a new twa, using a universal initial transition,
|
/// \brief Sum two twa into a new twa, using a universal initial transition,
|
||||||
/// performing the intersection of the two languages of the input automatons.
|
/// performing the intersection of the two languages of the input automata.
|
||||||
///
|
///
|
||||||
/// \param left Left term of the sum.
|
/// \param left Left term of the sum.
|
||||||
/// \param right Right term of the sum.
|
/// \param right Right term of the sum.
|
||||||
|
|
|
||||||
|
|
@ -68,7 +68,7 @@ def test_aut(aut):
|
||||||
del os.environ["SPOT_STREETT_CONV_MIN"]
|
del os.environ["SPOT_STREETT_CONV_MIN"]
|
||||||
assert equivalent(sltgba, slftgba)
|
assert equivalent(sltgba, slftgba)
|
||||||
|
|
||||||
# Those automatons are generated with ltl2dstar, which is NOT part of spot,
|
# Those automata are generated with ltl2dstar, which is NOT part of spot,
|
||||||
# using the following command:
|
# using the following command:
|
||||||
# genltl --eh-patterns --dac-patterns --hkrss-patterns --sb-patterns |\
|
# genltl --eh-patterns --dac-patterns --hkrss-patterns --sb-patterns |\
|
||||||
# ltldo "ltl2dstar --automata=streett --output-format=hoa\
|
# ltldo "ltl2dstar --automata=streett --output-format=hoa\
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue