We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Reseach Article

Modeling Internet Host Reliability using Higher-Order Time Petri Net

by Ali M. Meligy, Hani M. Ibrahim, Amal M. Aqlan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 83 - Number 2
Year of Publication: 2013
Authors: Ali M. Meligy, Hani M. Ibrahim, Amal M. Aqlan
10.5120/14421-2549

Ali M. Meligy, Hani M. Ibrahim, Amal M. Aqlan . Modeling Internet Host Reliability using Higher-Order Time Petri Net. International Journal of Computer Applications. 83, 2 ( December 2013), 24-28. DOI=10.5120/14421-2549

@article{ 10.5120/14421-2549,
author = { Ali M. Meligy, Hani M. Ibrahim, Amal M. Aqlan },
title = { Modeling Internet Host Reliability using Higher-Order Time Petri Net },
journal = { International Journal of Computer Applications },
issue_date = { December 2013 },
volume = { 83 },
number = { 2 },
month = { December },
year = { 2013 },
issn = { 0975-8887 },
pages = { 24-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume83/number2/14421-2549/ },
doi = { 10.5120/14421-2549 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:58:21.467965+05:30
%A Ali M. Meligy
%A Hani M. Ibrahim
%A Amal M. Aqlan
%T Modeling Internet Host Reliability using Higher-Order Time Petri Net
%J International Journal of Computer Applications
%@ 0975-8887
%V 83
%N 2
%P 24-28
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Higher-Order Petri Net is a new class of Petri Nets that exploit the properties of higher-order neural networks. Adding time to HOPN produces a new class called Higher-Order Time Petri Net, this is the subject of our study . In this paper, a method to model the internet host reliability with Higher-Order Time Petri Net is proposed. Analysis of HOTPN model is presented. A reachability graph is defined in a discrete way by using an enumeration procedure and the reachable states of the Time Petri Net and HOTPN. Finally, we compare between TPN and HOTPN by using the behavior properties and reachability graph.

References
  1. Staines, A. , 2010 Supporting Requirements Engineering with Different Petri Net Classes" International journal of computers, vol. 4 (4).
  2. Bachmann, J. and Popova-Zeugmann, L. , 2010 Time-independent Liveness in Time Petri Nets. IOS Press, Fundamental Informaticaevo, vol. 101, pp. 1–17.
  3. Meligy, A. , Ibrahim, H. , and Aqlan, A. , 2012 Internet Host Reliability Modeling with Time Petri Nets. International Journal of Computer Applications, vol. 47, no. 16.
  4. Chow, T. , Li, J-Y. , 1997 Higher-Order Petri Net Models Based on Artificial Neural Networks. Artificial Intelligence, V. 92, pp. 289-300.
  5. Popova, L. , 1991 On Time Petri Nets. J. Inform. Process. Cybern. EIK 27(1991)4, pp. 227–244.
  6. Popova-Zeugmann, L. , 2007 Time Petri Nets State Space Reduction Using Dynamic Programming. Journal of Control and Cybernetics, 35(3):721–748.
Index Terms

Computer Science
Information Sciences

Keywords

Time Petri Net (TPN) Higher-Order Petri Net (HOPN) Reachability Graph Internet Host Reliability.