1998
DOI: 10.1007/3-540-65306-6_19
|View full text |Cite
|
Sign up to set email alerts
|

Linear algebraic and linear programming techniques for the analysis of place/transition net systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
178
0
5

Year Published

2004
2004
2019
2019

Publication Types

Select...
6
3
1

Relationship

3
7

Authors

Journals

citations
Cited by 185 publications
(192 citation statements)
references
References 62 publications
0
178
0
5
Order By: Relevance
“…Two FMS examples are used to evaluate our deadlock prevention policy [12][13][14][15][16][17][18][19][20][21][22][23] . Example I: An FMS is shown in Figure 10 12 .…”
Section: Resultsmentioning
confidence: 99%
“…Two FMS examples are used to evaluate our deadlock prevention policy [12][13][14][15][16][17][18][19][20][21][22][23] . Example I: An FMS is shown in Figure 10 12 .…”
Section: Resultsmentioning
confidence: 99%
“…Introducing places {p2 , p3 , p4 } to put an order in the use of the robot: t21 -p2 -t1 , t1 -p3 -tb, tb-p4 -t22 (observe that p1 , for t22 -p1 -t21 , is equal to M2idle, and so it is already present and marked), the place representing the idle state of the robot becomes concurrently implicit [55], thus it can be removed for any time interpretation, and a marked graph is found (see Fig. 6).…”
Section: On the Optimal Scheduling: Performance Controlmentioning
confidence: 99%
“…Moreover, it can be observed that creates a parallel path between and , so it has no effect on the performance of the model, and can be removed (with the two arcs connected to it) [49]. Similarly, places , , and can also be removed (with their incident arcs) without any effect on the performance of the model as they all create parallel paths (in [37] such places are called "implicit places").…”
Section: Models Of Simple Cluster Toolsmentioning
confidence: 99%