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
|
// Unified token -*- c++ -*-
#ifdef __GNUC__
# pragma implementation
#endif // __GNUC__
#include "Token.h"
#include "VariableSet.h"
/** @file Token.C
* Tokens used in the unification process
*/
/* Copyright 1999-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. */
Token::~Token ()
{
delete myUnifiedUndefined;
delete myValue;
}
bool
Token::isBindable (const class Valuation& valuation)
{
assert (valuation.isOK ());
const class Expression& expr = *myUnifier.m->getToken ();
if (myUnifier.isSet) {
delete myValue;
if ((myValue = expr.meval (valuation))) {
assert (valuation.isOK ());
if (*myValue <= myPlaceMarking)
return true;
}
}
else if (class Value* value = expr.eval (valuation)) {
assert (valuation.isOK ());
myIterator = myPlaceMarking.find (value);
delete value;
if (myIterator != end ()) {
if (myCardinality <= PlaceMarking::getCount (myIterator))
return true;
myIterator = begin ();
}
}
return false;
}
bool
Token::isBindableUnfold (const class Valuation& valuation)
{
assert (valuation.isOK ());
const class Expression& expr = *myUnifier.m->getToken ();
if (myUnifier.isSet) {
delete myValue;
if ((myValue = expr.meval (valuation))) {
assert (valuation.isOK ());
return myValue->isSubset (myPlaceMarking);
}
}
else if (class Value* value = expr.eval (valuation)) {
assert (valuation.isOK ());
myIterator = myPlaceMarking.find (value);
delete value;
return myIterator != end ();
}
return false;
}
void
Token::undefine (class Valuation& valuation)
{
if (!myUnifier.vars)
return;
const class VariableSet& vars = *myUnifier.vars;
VariableSet::const_iterator i = vars.begin ();
if (!myUnifier.varMult)
for (; i != vars.end (); i++)
valuation.undefine (**i);
else
for (; i != vars.end (); i++)
if (!isUnified (**i)) valuation.undefine (**i);
}
void
Token::addUnified (const class Valuation& valuation)
{
assert (myUnifier.varMult);
assert (!myUnifiedUndefined);
const class VariableSet& vars = *myUnifier.vars;
for (VariableSet::const_iterator i = vars.begin (); i != vars.end (); i++) {
if (valuation.getValue (**i)) {
if (!myUnifiedUndefined) myUnifiedUndefined = new class VariableSet;
myUnifiedUndefined->insert (**i);
}
}
}
bool
Token::isUnified (const class VariableDefinition& var) const
{
return myUnifiedUndefined && myUnifiedUndefined->contains (var);
}
#ifndef NDEBUG
# include "VariableDefinition.h"
void
Token::assertUndefined (const class Valuation& valuation) const
{
const class VariableSet& vars = *myUnifier.vars;
for (VariableSet::const_iterator i = vars.begin (); i != vars.end (); i++)
assert (!valuation.getValue (**i) || (*i)->isUndefined ());
}
void
Token::assertDefined (const class Valuation& valuation) const
{
const class VariableSet& vars = *myUnifier.vars;
for (VariableSet::const_iterator i = vars.begin (); i != vars.end (); i++)
assert (!!valuation.getValue (**i));
}
#endif // NDEBUG
|
