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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
|
/* PeTe - Petri Engine exTremE
* Copyright (C) 2011 Jonas Finnemann Jensen <jopsen@gmail.com>,
* Thomas Søndersø Nielsen <primogens@gmail.com>,
* Lars Kærlund Østergaard <larsko@gmail.com>,
* Peter Gjøl Jensen <root@petergjoel.dk>
*
* 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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include "PetriNet.h"
#include "PQL/PQL.h"
#include "PQL/Contexts.h"
#include "Structures/State.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
using namespace std;
namespace PetriEngine {
PetriNet::PetriNet(uint32_t trans, uint32_t invariants, uint32_t places)
: _ninvariants(invariants), _ntransitions(trans), _nplaces(places),
_transitions(_ntransitions+1),
_invariants(_ninvariants),
_placeToPtrs(_nplaces+1) {
// to avoid special cases
_transitions[_ntransitions].inputs = _ninvariants;
_transitions[_ntransitions].outputs = _ninvariants;
_placeToPtrs[_nplaces] = _ntransitions;
_initialMarking = new MarkVal[_nplaces];
// assert(_nplaces > 0);
}
PetriNet::~PetriNet() {
delete[] _initialMarking;
}
int PetriNet::inArc(uint32_t place, uint32_t transition) const
{
assert(_nplaces > 0);
assert(place < _nplaces);
assert(transition < _ntransitions);
uint32_t imin = _transitions[transition].inputs;
uint32_t imax = _transitions[transition].outputs;
if(imin == imax)
{
// NO INPUT!
return 0;
}
for(;imin < imax; ++imin)
{
const Invariant& inv = _invariants[imin];
if(inv.place == place)
{
return inv.inhibitor ? 0 : _invariants[imin].tokens;
}
}
return 0;
}
int PetriNet::outArc(uint32_t transition, uint32_t place) const
{
assert(_nplaces > 0);
assert(place < _nplaces);
assert(transition < _ntransitions);
uint32_t imin = _transitions[transition].outputs;
uint32_t imax = _transitions[transition+1].inputs;
for(;imin < imax; ++imin)
{
if(_invariants[imin].place == place) return _invariants[imin].tokens;
}
return 0;
}
bool PetriNet::deadlocked(const MarkVal* m) const {
//Check that we can take from the marking
if(_nplaces == 0)
{
return _ntransitions == 0;
}
for (size_t i = 0; i < _nplaces; i++) {
if(i == 0 || m[i] > 0) // orphans are currently under "place 0" as a special case
{
uint32_t first = _placeToPtrs[i];
uint32_t last = _placeToPtrs[i+1];
for(;first != last; ++first)
{
const TransPtr& ptr = _transitions[first];
uint32_t finv = ptr.inputs;
uint32_t linv = ptr.outputs;
bool allgood = true;
for(;finv != linv; ++finv)
{
if(!_invariants[finv].inhibitor){
allgood &= m[_invariants[finv].place] >= _invariants[finv].tokens;
} else {
allgood &= m[_invariants[finv].place] < _invariants[finv].tokens;
}
if(!allgood){
break;
}
}
if(allgood)
{
return false;
}
}
}
}
return true;
}
std::pair<const Invariant*, const Invariant*> PetriNet::preset(uint32_t id) const
{
const TransPtr& transition = _transitions[id];
uint32_t first = transition.inputs;
uint32_t last = transition.outputs;
return std::make_pair(&_invariants[first], &_invariants[last]);
}
std::pair<const Invariant*, const Invariant*> PetriNet::postset(uint32_t id) const
{
uint32_t first = _transitions[id].outputs;
uint32_t last = _transitions[id+1].inputs;
return std::make_pair(&_invariants[first], &_invariants[last]);
}
bool PetriNet::fireable(const MarkVal *marking, int transitionIndex)
{
const TransPtr& transition = _transitions[transitionIndex];
uint32_t first = transition.inputs;
uint32_t last = transition.outputs;
for(;first < last; ++first){
const Invariant& inv = _invariants[first];
if(inv.inhibitor == (marking[inv.place] >= inv.tokens))
return false;
}
return true;
}
MarkVal* PetriNet::makeInitialMarking()
{
MarkVal* marking = new MarkVal[_nplaces];
memcpy(marking, _initialMarking, sizeof(MarkVal)*_nplaces);
return marking;
}
void PetriNet::sort()
{
for(size_t i = 0; i < _ntransitions; ++i)
{
TransPtr& t = _transitions[i];
std::sort(&_invariants[t.inputs], &_invariants[t.outputs], [](const auto& a, const auto& b) { return a.place < b.place; });
TransPtr& t2 = _transitions[i + 1];
std::sort(&_invariants[t.outputs], &_invariants[t2.inputs], [](const auto& a, const auto& b) { return a.place < b.place; });
}
}
void PetriNet::toXML(std::ostream& out)
{
out << "<?xml version=\"1.0\"?>\n"
<< "<pnml xmlns=\"http://www.pnml.org/version-2009/grammar/pnml\">\n"
<< "<net id=\"ClientsAndServers-PT-N0500P0\" type=\"http://www.pnml.org/version-2009/grammar/ptnet\">\n";
out << "<page id=\"page0\">\n"
<< "<name>\n"
<< "<text>DefaultPage</text>"
<< "</name>";
for(size_t i = 0; i < _nplaces; ++i)
{
auto& p = _placenames[i];
out << "<place id=\"" << p << "\">\n"
<< "<name><text>" << p << "</text></name>\n";
if(_initialMarking[i] > 0)
{
out << "<initialMarking><text>" << _initialMarking[i] << "</text></initialMarking>\n";
}
out << "</place>\n";
}
for(size_t i = 0; i < _ntransitions; ++i)
{
out << "<transition id=\"" << _transitionnames[i] << "\">\n"
<< "<name><text>" << _transitionnames[i] << "</text></name>\n";
out << "</transition>\n";
}
size_t id = 0;
for(size_t t = 0; t < _ntransitions; ++t)
{
auto pre = preset(t);
for(; pre.first != pre.second; ++pre.first)
{
out << "<arc id=\"" << (id++) << "\" source=\""
<< _placenames[pre.first->place] << "\" target=\""
<< _transitionnames[t]
<< "\" type=\""
<< (pre.first->inhibitor ? "inhibitor" : "normal")
<< "\">\n";
if(pre.first->tokens > 1)
{
out << "<inscription><text>" << pre.first->tokens << "</text></inscription>\n";
}
out << "</arc>\n";
}
auto post = postset(t);
for(; post.first != post.second; ++post.first)
{
out << "<arc id=\"" << (id++) << "\" source=\""
<< _transitionnames[t] << "\" target=\""
<< _placenames[post.first->place] << "\">\n";
if(post.first->tokens > 1)
{
out << "<inscription><text>" << post.first->tokens << "</text></inscription>\n";
}
out << "</arc>\n";
}
}
out << "</page></net>\n</pnml>";
}
} // PetriEngine
|