1
//////////////////////////////////////////////////////////////////////////////////
2
// This file is part of Toolkit for Conceptual Modeling (TCM).
3
// (c) copyright 2001, Universiteit Twente.
4
// Author: Rik Eshuis (eshuis@cs.utwente.nl).
6
// TCM 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 2 of the License, or
9
// (at your option) any later version.
11
// TCM 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.
16
// You should have received a copy of the GNU General Public License
17
// along with TCM; if not, write to the Free Software
18
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
20
////////////////////////////////////////////////////////////////////////////////
26
//#include "lstring.h"
28
//class AdKTransition;
32
//#include "AdKtransition.h"
33
//#include "AdKlocation.h"
37
//#include "adshypergraph.h"
44
/// class CKS, consisting of valuations and transitions
45
class ADSCks :public Graph {
46
/*@Doc: {\large {\bf scope:} diagram} */
49
ADSCks(ADSHyperGraph *a);
57
void InitConnections(){};
59
void WriteSubjects(OutputFile *f);
61
void WriteSMVFile(OutputFile *f, bool tlv);
63
//bool ExistsSimilarNode( ADSValuation *s);
65
bool ExistsSimilarEdge( ADSTransition *s);
67
ADSValuation *FindSimilarNode( ADSValuation *s);
68
/// checks whether the configuration in valuation s has become unbounded
69
/// using a check from the Karp Miller algorithm for Petri nets
70
bool GrowsInfinite(ADSValuation *s, string &str);
72
void GetClocks(List <string> *l);
73
/// generate index number for valuations
76
ADSHyperGraph *GetADSHyperGraph(){return am;};
77
/// get valuation with index i
78
ADSValuation *GetADSValuation(int i);
83
/// the original activity hypergraph
86
// ValuationHashList vhl;
88
// TransitionHashList thl;