Abstract
Distributed computing systems can be modeled adequately by Petri nets. The computation of invariants of Petri nets becomes necessary for proving the properties of modeled systems. This paper presents a two-phase, bottom-up approach for invariant computation and analysis of Petri nets. In the first phase, a newly defined subnet, called the RP-subnet, with an invariant is chosen. In the second phase, the selected RP-subnet is analyzed. Our methodology is illustrated with two examples viz., the dining philosophers’ problem and the connection-disconnection phase of a transport protocol. We believe that this new method, which is computationally no worse than the existing techniques, would simplify the analysis of many practical distributed systems.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 153-165 |
| Number of pages | 13 |
| Journal | International Journal of Computer Mathematics |
| Volume | 31 |
| Issue number | 3-4 |
| DOIs | |
| State | Published - Jan 1 1990 |
Fingerprint
Keywords
- Distributed systems
- invariant
- P-subnet
- Petri net
- RP-subnet
- subnet
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computer Science Applications
- Applied Mathematics
Cite this
A new methodology for analyzing distributed systems modeled by petri nets. / Sarkar, Dilip.
In: International Journal of Computer Mathematics, Vol. 31, No. 3-4, 01.01.1990, p. 153-165.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A new methodology for analyzing distributed systems modeled by petri nets
AU - Sarkar, Dilip
PY - 1990/1/1
Y1 - 1990/1/1
N2 - Distributed computing systems can be modeled adequately by Petri nets. The computation of invariants of Petri nets becomes necessary for proving the properties of modeled systems. This paper presents a two-phase, bottom-up approach for invariant computation and analysis of Petri nets. In the first phase, a newly defined subnet, called the RP-subnet, with an invariant is chosen. In the second phase, the selected RP-subnet is analyzed. Our methodology is illustrated with two examples viz., the dining philosophers’ problem and the connection-disconnection phase of a transport protocol. We believe that this new method, which is computationally no worse than the existing techniques, would simplify the analysis of many practical distributed systems.
AB - Distributed computing systems can be modeled adequately by Petri nets. The computation of invariants of Petri nets becomes necessary for proving the properties of modeled systems. This paper presents a two-phase, bottom-up approach for invariant computation and analysis of Petri nets. In the first phase, a newly defined subnet, called the RP-subnet, with an invariant is chosen. In the second phase, the selected RP-subnet is analyzed. Our methodology is illustrated with two examples viz., the dining philosophers’ problem and the connection-disconnection phase of a transport protocol. We believe that this new method, which is computationally no worse than the existing techniques, would simplify the analysis of many practical distributed systems.
KW - Distributed systems
KW - invariant
KW - P-subnet
KW - Petri net
KW - RP-subnet
KW - subnet
UR - http://www.scopus.com/inward/record.url?scp=0002331756&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0002331756&partnerID=8YFLogxK
U2 - 10.1080/00207169008803798
DO - 10.1080/00207169008803798
M3 - Article
VL - 31
SP - 153
EP - 165
JO - International Journal of Computer Mathematics
JF - International Journal of Computer Mathematics
SN - 0020-7160
IS - 3-4
ER -