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
|
// A state in the property automaton -*- c++ -*-
#ifdef __GNUC__
# pragma implementation
#endif // __GNUC__
#include "PropertyState.h"
#include "Constant.h"
#include "BitVector.h"
#include "LeafValue.h"
#include <string.h>
/** @file PropertyState.C
* A state in the property automaton
*/
/* Copyright 2000-2002 Marko Mkel (msmakela@tcs.hut.fi).
This file is part of MARIA, a reachability analyzer and model checker
for high-level Petri nets.
MARIA 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, or (at your option)
any later version.
MARIA 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.
The GNU General Public License is often shipped with GNU software, and
is generally kept in a file called COPYING or LICENSE. If you do not
have a copy of the license, write to the Free Software Foundation,
59 Temple Place, Suite 330, Boston, MA 02111 USA. */
PropertyState::~PropertyState ()
{
delete[] mySuccessors;
while (myNumSuccessors--)
myGates[myNumSuccessors]->destroy ();
delete[] myGates;
}
void
PropertyState::addSuccessor (unsigned num,
class Expression& gate)
{
/** Flag: is this a constant (constantly enabled) gate */
bool constant = gate.getKind () == Expression::eConstant;
if (constant) {
const class Value& v = static_cast<class Constant&>(gate).getValue ();
assert (v.getKind () == Value::vLeaf);
// Ignore constantly disabled gates
if (!bool (static_cast<const class LeafValue&>(v))) {
gate.destroy ();
return;
}
}
unsigned i = myNumSuccessors++;
unsigned* successors = new unsigned[myNumSuccessors];
class Expression** gates = new class Expression*[myNumSuccessors];
if (constant) {
// add constantly enabled gates to the beginning of the array
memcpy (successors + 1, mySuccessors, i * sizeof *successors);
memcpy (gates + 1, myGates, i * sizeof *gates);
*successors = num;
*gates = &gate;
}
else {
// add conditionally enabled gates to the end of the array
memcpy (successors, mySuccessors, i * sizeof *successors);
memcpy (gates, myGates, i * sizeof *gates);
successors[i] = num;
gates[i] = &gate;
}
delete[] mySuccessors;
delete[] myGates;
mySuccessors = successors;
myGates = gates;
}
bool
PropertyState::eval (const class Valuation& valuation,
unsigned*& result,
unsigned final) const
{
assert (valuation.isOK ());
*(result = new unsigned[myNumSuccessors + 1]) = 0;
for (unsigned i = myNumSuccessors; i--; ) {
if (class Value* v = myGates[i]->eval (valuation)) {
assert (valuation.isOK ());
assert (v->getKind () == Value::vLeaf);
if (bool (static_cast<const class LeafValue&>(*v))) {
result[++(*result)] = mySuccessors[i];
delete v;
if (mySuccessors[i] == final)
return false;
}
else
delete v;
}
else {
assert (!valuation.isOK ());
return false;
}
}
return true;
}
#ifdef EXPR_COMPILE
# include "CExpression.h"
void
PropertyState::compileGates (class CExpression& cexpr,
unsigned indent,
const char* result,
unsigned final) const
{
class StringBuffer& out = cexpr.getOut ();
out.indent (indent);
out.append ("*"), out.append (result), out.append ("=0;\n");
for (unsigned i = myNumSuccessors; i--; ) {
if (myGates[i]->getKind () == Expression::eConstant) {
const class Value& v =
static_cast<const class Constant*>(myGates[i])->getValue ();
assert (v.getKind () == Value::vLeaf);
if (!bool (static_cast<const class LeafValue&>(v)))
continue;
out.indent (indent);
}
else {
const char* work = cexpr.getFlag ();
myGates[i]->compile (cexpr, indent, work, 0);
out.indent (indent);
out.append ("if ("), out.append (work), out.append (") ");
}
if (mySuccessors[i] == final) {
out.append ("{\n");
cexpr.compileError (indent + 2, errNone);
out.indent (indent + 2);
}
out.append (result);
out.append ("[++(*"), out.append (result); out.append (")]=");
out.append (mySuccessors[i]), out.append (";\n");
if (mySuccessors[i] == final) {
out.indent (indent + 2), out.append ("return errComp;\n");
out.indent (indent), out.append ("}\n");
}
}
cexpr.compileError (indent, errNone);
}
#endif // EXPR_COMPILE
|
