You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently many methods for generating test sequences (such as characterizing sets or transition covers) are computed in bulk operations. With this ticket, support for a lazy computation of these sequences (by means of an Itera{ble,tor}) should be added.
This would allow for a better performance in cases with large target automata. Also, this would nicely integrate with the lazy equivalence oracles of LearnLib, which have been added in LearnLib/learnlib@0bd5d78c (and they should be updated too, once this is implemented).
Currently, the following sequences can be computed and therefore need a lazyfied version
State cover
normal version
incremental version
Transition cover
normal version
incremental version
CharacterizingSet
normal version
incremental version
The text was updated successfully, but these errors were encountered:
- Refactored Covers class and its internal structure
- Removed some redundant method definitions in Automata class
- Added iterators for lazy computations of state and transition covers (see #17)
- Added and updated test cases
Currently many methods for generating test sequences (such as characterizing sets or transition covers) are computed in bulk operations. With this ticket, support for a lazy computation of these sequences (by means of an Itera{ble,tor}) should be added.
This would allow for a better performance in cases with large target automata. Also, this would nicely integrate with the lazy equivalence oracles of LearnLib, which have been added in LearnLib/learnlib@0bd5d78c (and they should be updated too, once this is implemented).
Currently, the following sequences can be computed and therefore need a lazyfied version
The text was updated successfully, but these errors were encountered: