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
////////////////////////////////////////////////////////////////////////////////
25
#include "adshypergraph.h"
26
#include "atdiagram.h"
36
/*@Doc: {\large {\bf scope:} } */
38
/// some generic checks on activity graphs needed in order to make
39
/// sure that the elimination of pseudo state nodes can be conducted
42
/// copy g to h and parse the labels on g's edges
43
bool FillAH(Graph *g, ADSHyperGraph *h );
45
/// eliminate the OR nodes in h
46
bool ElimOrNodes(ADSHyperGraph *h);
48
/// used for parsing labels on simple edges
49
bool ParseGuardLabel(const string *str);
51
/// eliminate the AND nodes in h
52
bool ElimAndNodes(ADSHyperGraph *h);
54
/// update the proplist in ah by setting for each property
55
/// which variables that property refers to
56
void UpdatePropList(ADSHyperGraph *ah);
59
bool EliminatePseudoStateNodes(Graph *g, ADSHyperGraph *h);