Abstract
Augmented marked graphs possess some structural characteristics desirable for modelling shared resource systems such as manufacturing systems. However, there are only a few known properties on augmented marked graphs, and these known properties are mainly on liveness and reversibility. In this paper, the properties of augmented marked graphs are reviewed extensively. Siphon-based and cycle-based characterisations for liveness and reversibility as well as transformation-based characterisations for boundedness and conservativeness are proposed. Pretty simple conditions and procedures are then derived for checking the liveness, reversibility, boundedness and conservativeness of augmented marked graphs. The dining philosopher problem is used for illustration.
| Original language | English |
|---|---|
| Pages (from-to) | 85-94 |
| Number of pages | 10 |
| Journal | Informatica (Ljubljana) |
| Volume | 32 |
| Issue number | 1 |
| Publication status | Published - Apr 2008 |
| Externally published | Yes |
Keywords
- Augmented marked graph
- Boundedness
- Conservativeness
- Liveness
- Petri net
- Reversibility