Giters

ModelInference / texada

Efficient techniques for mining LTL formulae over linear input traces

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Refactor linear checker to allow prefix tree checker to inherit from it

bestchai opened this issue · comments

commented

Refactor the linear checker in the following ways:

  1. Create some sort of union for the trace nodes, so that the check() methods can take a prefix tree node or a linear node
  2. Turn precise operations on the trace nodes (e.g. getting the name, getting the next event, getting whether this is terminal) into functions
  3. Implement memoization functionality. For now this will have no use intra-instantiations or for the linear trace checker really. Eventually, if the map is modified to include equivalence equality on LTL formulae subtrees it will have use intra-instantiation. This is necessary for the prefix tree checker, though.

[Issue created by carolemieux: 2014-08-11]
[Last updated on bitbucket: 2014-08-16]

[Comment created by carolemieux: 2014-08-16]
This issue has been majorly changed because this proved to make the linear checker disastrously slow. So instead all checkers have been refactored to have inheritance behaviour. See rev 5238423