1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/* gta_example.c - GTA package example dummy application */
/*
* MONA
* Copyright (C) 1997-2002 BRICS.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
* USA.
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "gta.h"
#define MAXVARS 1000
Guide guide;
char *my_global_variable;
bdd_manager *global_bddm;
void check_off_index(bdd_record *node_pointer)
/*this function is written using primitives at a lower level
than using the bdd_then and bdd_else; the reason is that
bdd_operate_on_nodes requires a C pointer a BDD node, not
something of the type bdd_ptr */
{
bdd_ptr low, high;
unsigned index;
LOAD_lri(node_pointer, low, high, index);
if (index != BDD_LEAF_INDEX) {
if (my_global_variable[index] == 0)
my_global_variable[index] = 1;
}
else {}
}
int main () {
GTA* G;
char **free_vars;
int *orders;
unsigned numvars;
SSSet *statespaces;
/*read the automaton from a file, the TRUE argument means that the
guide is being defined by the automaton description in the file */
G = gtaImport("html.gta", &free_vars, &orders, &statespaces, TRUE);
if(!G) {
printf("error: file 'html.gta' not found (run 'mona -n html.mona')\n");
exit(1);
}
printf("Guide: number of state spaces is %d\n", guide.numSs);
/* illustrate use of state space names */
{
SsId d;
for (d = 0; d < guide.numSs; d++)
printf("State space %s is numbered %d\n", guide.ssName[d], d);
}
/* illustrate use of inherited acceptance information */
{
SsId d;
State p;
int s;
boolean ***inheritedAcceptance = gtaCalcInheritedAcceptance(G);
for (d = 0; d < guide.numSs; d++) {
printf("State space %d\n", d);
for (p = 0; p < G->ss[d].size; p++)
for (s = 1; s >= -1; s--)
printf(" State %d can%s lead to %s\n",
p, inheritedAcceptance[d][p][s]? "": " not",
(s==1)? "accept":(s==0)? "don't care": "reject");
}
gtaFreeInheritedAcceptance(inheritedAcceptance);
}
/* illustrate how to find indices of free variables and how to find
out about their order (Boolean, first-order, or second-order) */
{
unsigned i;
numvars = 0;
while (free_vars[numvars] != 0)
numvars++;
printf("Number of free variables: %d\n", numvars);
if (numvars != 6) {
printf("Oops\n");
exit(1);
}
/* get table index of variable G1 */
for (i = 0; i < numvars; i++)
if (strcmp(free_vars[i], "G1")==0)
break;
if (i == numvars)
printf("G1 not found\n");
else {
printf("G1 has index %d and is %d. order\n", i, orders[i]);
}
}
/* illustrate how to analyze the BDD associated with an entry in the
transition table */
{ /* lookup, say, transition corresponding to state space 1,
state pair (left, right) = (4,3) */
unsigned i;
bdd_ptr my_bdd_ptr = BDD_ROOT(G->ss[1].bddm, BEH(G->ss[1], 4, 3));
char var_is_used[MAXVARS]; /* var_is_used[i] is true iff variable i
is the index of some BDD node in
the DAG rooted in my_bdd_ptr */
printf("State space 0 goes to (%d, %d)\n",
guide.muLeft[0], guide.muRight[0]);
printf("State space 1 goes to (%d, %d)\n",
guide.muLeft[1], guide.muRight[1]);
printf("Number of BDD nodes in state space 1: %d\n", bdd_size(G->ss[1].bddm));
for (i = 0; i < numvars; i++)
var_is_used[i] = 0;
bdd_prepare_apply1(G->ss[1].bddm);
my_global_variable = var_is_used;
global_bddm = (G->ss[1].bddm);
bdd_operate_on_nodes(G->ss[1].bddm, my_bdd_ptr, &check_off_index);
for (i = 0; i < numvars; i++)
if (var_is_used[i])
printf("Variable %s in use for transitions from (4,3) in state space 1\n",
free_vars[i]);
}
/* illustrate how to perform a lookup in the transition table */
{
char bit_vector[6] = {0, 1, 1, 0, 1, 0};
bdd_manager *bddm = G->ss[1].bddm;
bdd_ptr my_bdd_ptr = BDD_ROOT(bddm, BEH(G->ss[1], 0, 2));
while (!bdd_is_leaf(bddm, my_bdd_ptr)) {
my_bdd_ptr = (bit_vector[bdd_ifindex(bddm, my_bdd_ptr)])?
bdd_then(bddm, my_bdd_ptr):
bdd_else(bddm, my_bdd_ptr);
}
printf("State reached from (0,2) on {0, 1, 1, 0, 1, 0} is %d\n",
bdd_leaf_value(bddm, my_bdd_ptr));
}
return 0;
}
|
