← Back to branch summary

~verifypn-cpn/verifypn/colored

« back to all changes in this revision

Viewing changes to PetriEngine/Reachability/BreadthFirstReachabilitySearch.h

  • Committer: Jonas Finnemann Jensen
  • Date: 2011-09-15 13:30:00 UTC
  • Revision ID: jopsen@gmail.com-20110915133000-wnywm1odf82emiuw
Import of sources from github

Show diffs side-by-side

added added

removed removed

Lines of Context:
PetriEngine/Reachability/BreadthFirstReachabilitySearch.h
 
1
/* PeTe - Petri Engine exTremE
 
2
 * Copyright (C) 2011  Jonas Finnemann Jensen <jopsen@gmail.com>,
 
3
 *                     Thomas Søndersø Nielsen <primogens@gmail.com>,
 
4
 *                     Lars Kærlund Østergaard <larsko@gmail.com>,
 
5
 * 
 
6
 * This program is free software: you can redistribute it and/or modify
 
7
 * it under the terms of the GNU General Public License as published by
 
8
 * the Free Software Foundation, either version 3 of the License, or
 
9
 * (at your option) any later version.
 
10
 * 
 
11
 * This program is distributed in the hope that it will be useful,
 
12
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 
13
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 
14
 * GNU General Public License for more details.
 
15
 * 
 
16
 * You should have received a copy of the GNU General Public License
 
17
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 
18
 */
 
19
#ifndef BREADTHFIRSTREACHABILITYSEARCH_H
 
20
#define BREADTHFIRSTREACHABILITYSEARCH_H
 
21
 
 
22
#include "ReachabilitySearchStrategy.h"
 
23
#include "../Structures/State.h"
 
24
 
 
25
namespace PetriEngine { namespace Reachability {
 
26
 
 
27
/** Implements reachability check in a BFS manner using a hash table */
 
28
class BreadthFirstReachabilitySearch : public ReachabilitySearchStrategy {
 
29
public:
 
30
        BreadthFirstReachabilitySearch(int kbound = 0, int memorylimit = 0)
 
31
                : ReachabilitySearchStrategy(){
 
32
                _kbound = kbound;
 
33
                _memorylimit = memorylimit;
 
34
        }
 
35
 
 
36
        /** Perform reachability check using BFS with hasing */
 
37
        ReachabilityResult reachable(const PetriNet &net,
 
38
                                                                 const MarkVal *m0,
 
39
                                                                 const VarVal *v0,
 
40
                                                                 PQL::Condition *query);
 
41
private:
 
42
        int _kbound;
 
43
        int _memorylimit;
 
44
};
 
45
 
 
46
}} // Namespaces
 
47
 
 
48
#endif // BREADTHFIRSTREACHABILITYSEARCH_H