New primitives for interlaced memory policies in Markov regenerative Stochastic Petri Nets

Andrea Bobbio, Antonio Puliafito, M. Telek

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

The non-Markovian Stochastic Petri Net (SPN) models appeared so far in the literature, are based on the assumption that the underlying marking process can be specified by assigning an individual memory policy to each timed transition. The present paper proposes to introduce interlaced, or state dependent, memory policies, where the memory of a transition can be modified by the occurrence of some condition on the net. Adhering to the spirit of the graphical language of the PN, we introduce new primitives in the form of suitable arcs connecting places to transitions, and whose effect is to modify the memory policy of the transition. Through a number of simple examples, we show how the new primitives increase the modeling power of non-Markovian SPN by allowing firing mechanisms which were not possible in the traditional models. Numerical results on the steady state behavior of a dependable processor system with two kinds of interruptions are also presented.

Original languageEnglish
Title of host publicationInternational Workshop on Petri Nets and Performance Models
Editors Anon
PublisherIEEE
Pages70-79
Number of pages10
Publication statusPublished - 1997
EventProceedings of the 1997 7th International Workshop on Petri Nets and Performance Models - Saint Malo, Fr
Duration: Jun 3 1997Jun 6 1997

Other

OtherProceedings of the 1997 7th International Workshop on Petri Nets and Performance Models
CitySaint Malo, Fr
Period6/3/976/6/97

Fingerprint

Stochastic Petri Nets
Petri nets
Data storage equipment
Arc of a curve
Numerical Results
Policy
Dependent
Modeling
Model

ASJC Scopus subject areas

  • Applied Mathematics
  • Modelling and Simulation

Cite this

Bobbio, A., Puliafito, A., & Telek, M. (1997). New primitives for interlaced memory policies in Markov regenerative Stochastic Petri Nets. In Anon (Ed.), International Workshop on Petri Nets and Performance Models (pp. 70-79). IEEE.

New primitives for interlaced memory policies in Markov regenerative Stochastic Petri Nets. / Bobbio, Andrea; Puliafito, Antonio; Telek, M.

International Workshop on Petri Nets and Performance Models. ed. / Anon. IEEE, 1997. p. 70-79.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bobbio, A, Puliafito, A & Telek, M 1997, New primitives for interlaced memory policies in Markov regenerative Stochastic Petri Nets. in Anon (ed.), International Workshop on Petri Nets and Performance Models. IEEE, pp. 70-79, Proceedings of the 1997 7th International Workshop on Petri Nets and Performance Models, Saint Malo, Fr, 6/3/97.
Bobbio A, Puliafito A, Telek M. New primitives for interlaced memory policies in Markov regenerative Stochastic Petri Nets. In Anon, editor, International Workshop on Petri Nets and Performance Models. IEEE. 1997. p. 70-79
Bobbio, Andrea ; Puliafito, Antonio ; Telek, M. / New primitives for interlaced memory policies in Markov regenerative Stochastic Petri Nets. International Workshop on Petri Nets and Performance Models. editor / Anon. IEEE, 1997. pp. 70-79
@inproceedings{921da06b97cf4da78ff7d09e60dc1e19,
title = "New primitives for interlaced memory policies in Markov regenerative Stochastic Petri Nets",
abstract = "The non-Markovian Stochastic Petri Net (SPN) models appeared so far in the literature, are based on the assumption that the underlying marking process can be specified by assigning an individual memory policy to each timed transition. The present paper proposes to introduce interlaced, or state dependent, memory policies, where the memory of a transition can be modified by the occurrence of some condition on the net. Adhering to the spirit of the graphical language of the PN, we introduce new primitives in the form of suitable arcs connecting places to transitions, and whose effect is to modify the memory policy of the transition. Through a number of simple examples, we show how the new primitives increase the modeling power of non-Markovian SPN by allowing firing mechanisms which were not possible in the traditional models. Numerical results on the steady state behavior of a dependable processor system with two kinds of interruptions are also presented.",
author = "Andrea Bobbio and Antonio Puliafito and M. Telek",
year = "1997",
language = "English",
pages = "70--79",
editor = "Anon",
booktitle = "International Workshop on Petri Nets and Performance Models",
publisher = "IEEE",

}

TY - GEN

T1 - New primitives for interlaced memory policies in Markov regenerative Stochastic Petri Nets

AU - Bobbio, Andrea

AU - Puliafito, Antonio

AU - Telek, M.

PY - 1997

Y1 - 1997

N2 - The non-Markovian Stochastic Petri Net (SPN) models appeared so far in the literature, are based on the assumption that the underlying marking process can be specified by assigning an individual memory policy to each timed transition. The present paper proposes to introduce interlaced, or state dependent, memory policies, where the memory of a transition can be modified by the occurrence of some condition on the net. Adhering to the spirit of the graphical language of the PN, we introduce new primitives in the form of suitable arcs connecting places to transitions, and whose effect is to modify the memory policy of the transition. Through a number of simple examples, we show how the new primitives increase the modeling power of non-Markovian SPN by allowing firing mechanisms which were not possible in the traditional models. Numerical results on the steady state behavior of a dependable processor system with two kinds of interruptions are also presented.

AB - The non-Markovian Stochastic Petri Net (SPN) models appeared so far in the literature, are based on the assumption that the underlying marking process can be specified by assigning an individual memory policy to each timed transition. The present paper proposes to introduce interlaced, or state dependent, memory policies, where the memory of a transition can be modified by the occurrence of some condition on the net. Adhering to the spirit of the graphical language of the PN, we introduce new primitives in the form of suitable arcs connecting places to transitions, and whose effect is to modify the memory policy of the transition. Through a number of simple examples, we show how the new primitives increase the modeling power of non-Markovian SPN by allowing firing mechanisms which were not possible in the traditional models. Numerical results on the steady state behavior of a dependable processor system with two kinds of interruptions are also presented.

UR - http://www.scopus.com/inward/record.url?scp=0030673699&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030673699&partnerID=8YFLogxK

M3 - Conference contribution

SP - 70

EP - 79

BT - International Workshop on Petri Nets and Performance Models

A2 - Anon, null

PB - IEEE

ER -