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
|
// Maria boolean negation operator class -*- c++ -*-
#ifndef NOTEXPRESSION_H_
# define NOTEXPRESSION_H_
# ifdef __GNUC__
# pragma interface
# endif // __GNUC__
# include "Expression.h"
/** @file NotExpression.h
* Boolean negation operator
*/
/* Copyright 1998-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. */
/** Boolean negation operator expression */
class NotExpression : public Expression
{
protected:
/** Constructor
* @param expr Expression the negation is applied to
*/
NotExpression (class Expression& expr);
private:
/** Copy constructor */
NotExpression (const class NotExpression& old);
/** Assignment operator */
class NotExpression& operator= (const class NotExpression& old);
protected:
/** Destructor */
~NotExpression ();
public:
/** Determine the type of the expression */
enum Expression::Kind getKind () const { return eNot; }
/** Determine whether this is a basic expression */
bool isBasic () const { return myExpr->isBasic (); }
/** Determine whether this is a temporal logic expression */
bool isTemporal () const { return myExpr->isTemporal (); }
/** Construct a NotExpression, optimizing double negations away
* @param expr expression to be negated
* @return negation of the expression
*/
static class Expression* construct (class Expression& expr);
/** Equality comparison operator */
bool operator== (const class NotExpression& other) const {
return *myExpr == *other.myExpr;
}
/** Ordering comparison operator */
bool operator< (const class NotExpression& other) const {
return *myExpr < *other.myExpr;
}
/** Evaluate the expression
* @param valuation Variable substitutions
* @return Value of the expression, or NULL in case of error
*/
class Value* do_eval (const class Valuation& valuation) const;
/** Partially evaluate the expression using a valuation
* @param valuation Variable substitutions
* @param transition Transition for registering quantified variables
* @param declare flag: declare new variables if required
* @return grounded expression, or NULL in case of error
*/
class Expression* ground (const class Valuation& valuation,
class Transition* transition,
bool declare);
/** Substitute some variables in the expression with expressions
* @param substitution Variable substitutions
* @return substituted expression
*/
class Expression* substitute (class Substitution& substitution);
/** Determine whether the expression depends on a set of variables
* @param vars the set of variables
* @param complement flag: treat the set as its complement
*/
bool depends (const class VariableSet& vars,
bool complement) const;
/** Perform an operation on all variables of the expression
* @param operation operation to be performed (return false on failure)
* @param data parameters to be passed to the operation
* @return true if all operations succeeded
*/
bool forVariables (bool (*operation)
(const class Expression&,void*),
void* data) const;
/** Remove transition qualifiers from the expression
* @param transition the transition for which the expression is qualified
* @return the expession without qualifiers, or NULL
*/
class Expression* disqualify (const class Transition& transition);
/** Translate the expression to a list of temporal logic connectives
* and Boolean propositions
* @param property the property automaton
* @return the translated object
*/
class Ltl* toFormula (class Property& property);
# ifdef EXPR_COMPILE
/** Generate C code for evaluating the expression
* @param cexpr the compilation
* @param indent indentation level
* @param lvalue C expression referring to the lvalue
* @param vars the variables that have been assigned a value
*/
void compile (class CExpression& cexpr,
unsigned indent,
const char* lvalue,
const class VariableSet* vars) const;
# endif // EXPR_COMPILE
/** Display the expression
* @param printer the printer object
*/
void display (const class Printer& printer) const;
private:
/** The subexpression */
class Expression* myExpr;
};
#endif // NOTEXPRESSION_H_
|
