LearnLib / automatalib / 19864403395

93%

push

github

Code for Mealy machines with local timers. (#96)

* Added MMLT classes

* Added basic tests for MMLTs; included sample MMLT model file.

* Added serialization test for MMLTs.

* Separated more files into API and implementation to enable use from LearnLib.

* Removed I prefix for some interfaces for the MMLT automaton.

* Updated calculation of MMLT location cover to accept a list of inputs to be considered.

* Method for finding a separating word in an MMLT now considers a provided collection of inputs.

* Convenience flag for faster location cover calculation.

* Added more tests for the reduced semantics.

* Parser for MMLTs now accepts an input stream, in addition to a file.

* Updated Serialization for MMLTs: resets-attribute for edges is now included when resets cannot be inferred from context.

* initial refactorings / cleanups

* use InputSymbols directly

* use input type I directly

* Removed getUntimedAlphabet, as it has the same function as getInputAlphabet.

* CompactMMLT: allow for sizeHints

* MMLTs: add direct equivalence check

* make code-analysis pass

* mention MMLTs in README

* adjust to LearnLib refactorings

* add documentation

* add some more test cases

* Using LinkedHashMap instead of HashMap in MMLT-Cover for deterministic ordering.

* MMLT transition output can no longer be null.

* Added more validation tests for the MMLT-parser.

* TimerInfo now supports multiple outputs per timer. StringSymbolCombiner expects atomic outputs for its input list when combining symbols.

* MMLT parser now parses multiple outputs for one timer. Updated corresponding tests.

* fix analysis and adjust to LearnLib refactorings

* cleanups

* documentation

* last de-stream-ifications

---------

Co-authored-by: Paul Kogel <p.kogel@tu-berlin.de>
Co-authored-by: Markus Frohme <markus.frohme@udo.edu>

649 of 661 new or added lines in 21 files covered. (98.18%)

17146 of 18482 relevant lines covered (92.77%)

1.72 hits per line