-
Notifications
You must be signed in to change notification settings - Fork 1
/
TLFormulaWAITFOR.cpp
145 lines (118 loc) · 3.88 KB
/
TLFormulaWAITFOR.cpp
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
/*
* File: TLFormulaWAITFOR.cc
* Project: QUEST
* Author: Marc Diefenbruch, Axel M. Hirche
* Date: (C) 1997, 1998 University of Essen, Germany
*/
//#include <assert.h>
#include "TLFormulaWAITFOR.h"
#include "TLFormulaUNTIL.h"
#include "TLFormulaV_OPER.h"
#include "TLFormulaZ_OPER.h"
#include "TLFormulaFALSE.h"
#include "TLFormulaOR.h"
#if _TL_INLINING_ == 0
#include "TLFormulaWAITFOR.inl.h"
#endif
#if _SC_DMALLOC
#include <dmalloc.h>
#endif
TLFormulaWAITFOR::~TLFormulaWAITFOR (void)
{
/* void */
}
TLFormula* TLFormulaWAITFOR::GetCopy (void) const
{
return new TLFormulaWAITFOR (this);
}
TLFormula* TLFormulaWAITFOR::Rewrite (void) const
{
assert (leftOperand);
assert (rightOperand);
if (simplifyFormulae)
{
if (rightOperand->Operator() == WAITFOR)
{
assert (((TLFormulaWAITFOR*)rightOperand)->RightOperand());
assert (((TLFormulaWAITFOR*)rightOperand)->LeftOperand());
if (*((TLFormulaWAITFOR*)rightOperand)->LeftOperand() == *leftOperand)
{
return rightOperand->Rewrite(); // a W (a W b) <-> a W b
}
}
if (leftOperand->Operator() == WAITFOR)
{
assert (((TLFormulaWAITFOR*)leftOperand)->RightOperand());
assert (((TLFormulaWAITFOR*)leftOperand)->LeftOperand());
if (*((TLFormulaWAITFOR*)leftOperand)->RightOperand() == *rightOperand)
{
return leftOperand->Rewrite(); // (a W b) W b <-> a W b
}
}
if (rightOperand->Operator() == UNTIL)
{
TLFormulaUNTIL* tmpRight = (TLFormulaUNTIL*) rightOperand;
assert (tmpRight->LeftOperand());
assert (tmpRight->RightOperand());
if (*tmpRight->LeftOperand() == *leftOperand)
{
return new TLFormulaWAITFOR (leftOperand->Rewrite(),
tmpRight->RightOperand()->Rewrite());
// a W (a U b) <-> a W b
}
}
if (leftOperand->Operator() == UNTIL)
{
TLFormulaUNTIL* tmpLeft = (TLFormulaUNTIL*) leftOperand;
assert (tmpLeft->LeftOperand());
assert (tmpLeft->RightOperand());
if (*tmpLeft->RightOperand() == *rightOperand)
{
return new TLFormulaUNTIL(tmpLeft->LeftOperand()->Rewrite(),
rightOperand->Rewrite());
// (a U b) W b <-> a U b
}
}
}
if (TLFormula::partialRewrite)
{
return new TLFormulaWAITFOR (leftOperand->Rewrite(),
rightOperand->Rewrite());
}
else
{
TLFormulaFALSE* tmpLeftLeft = new TLFormulaFALSE();
TLFormula* tmpLeftRight = leftOperand->Rewrite();
TLFormulaV_OPER* tmpLeft = new TLFormulaV_OPER (tmpLeftLeft,
tmpLeftRight);
TLFormulaUNTIL* tmpRight = new TLFormulaUNTIL (leftOperand->Rewrite(),
rightOperand->Rewrite());
assert (tmpLeft);
assert (tmpRight);
return new TLFormulaOR (tmpLeft,
tmpRight);
// a W b <==> []a || a U b
// a W b <==> false V a || a U b
}
}
TLFormula* TLFormulaWAITFOR::PushNegations (SCBoolean doIt) const
{
if (TLFormula::partialRewrite)
{
if (doIt)
return new TLFormulaZ_OPER (leftOperand->PushNegations(doIt),
rightOperand->PushNegations(doIt));
else
return new TLFormulaWAITFOR (leftOperand->PushNegations(doIt),
rightOperand->PushNegations(doIt));
}
else
{
TLAssert (false, "No WAITFOR allowed.");
return NULL;
}
}
SCNatural TLFormulaWAITFOR::GetPrecedenceLevel (void) const
{
return PREC_LEVEL_1;
}