← Back to branch summary

~tapaal-ltl/verifypn/scc-optimise

« back to all changes in this revision

Viewing changes to include/CTL/SearchStrategy/RDFSSearch.h

  • Committer: srba.jiri at gmail
  • Date: 2020-09-11 14:23:39 UTC
  • mfrom: (213.1.151 interval_tar)
  • Revision ID: srba.jiri@gmail.com-20200911142339-bq9328s1gppw24uj
merged in lp:~verifypn-maintainers/verifypn/interval_tar doing 
- Implements TAR w/o z3, but using a simple integer inference engine for Hoare logic.
 - Replaces LP-Solve with GLPK, reduces computation-time and memory overhead
 - Implements new global properties, translated into CTL formulae.

Show diffs side-by-side

added added

removed removed

Lines of Context:
include/CTL/SearchStrategy/RDFSSearch.h
 
1
/* 
 
2
 * File:   Encoder.h
 
3
 * Author: Peter G. Jensen
 
4
 *
 
5
 * Created on March 7, 2018, 1:52 PM
 
6
 */
 
7
 
 
8
#ifndef RDFSSEARCH_H
 
9
#define RDFSSEARCH_H
 
10
 
 
11
#include <deque>
 
12
#include "CTL/DependencyGraph/Edge.h"
 
13
#include "SearchStrategy.h"
 
14
 
 
15
namespace SearchStrategy {
 
16
 
 
17
// A custom search strategy that should ensure as little overhead as possible
 
18
// while running sequential computation.
 
19
 
 
20
class RDFSSearch : public SearchStrategy {
 
21
public:
 
22
    void flush();
 
23
protected:
 
24
    size_t Wsize() const;
 
25
    void pushToW(DependencyGraph::Edge* edge);
 
26
    DependencyGraph::Edge* popFromW();
 
27
    std::vector<DependencyGraph::Edge*> W;
 
28
    size_t last_parent = 0;
 
29
};
 
30
 
 
31
}   // end SearchStrategy
 
32
 
 
33
#endif /* RDFSSEARCH_H */
 
34