Computational restrictions for SPN with generally distributed transition times

Andrea Bobbio, M. Telek

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

8 Citations (Scopus)

Abstract

The analysis of stochastic systems with non-exponential timing requires the development of suitable modeling tools. Recently, some effort has been devoted to generalize the concept of Stochastic Petri nets, by allowing the firing times to be generally distributed. The evolution of the PN in time becomes a stochastic process, for which in general, no analytical solution is available. The paper describes suitable restrictions of the PN model with generally distributed transition times, that have appeared in the literature, and compares these models from the point of view of the modeling power and the numerical tractability.

Original languageEnglish
Title of host publicationDependable Computing - EDCC-1 - 1st European Dependable Computing Conference, Proceedings
PublisherSpringer Verlag
Pages131-148
Number of pages18
ISBN (Print)9783540584261
Publication statusPublished - Jan 1 1994
Event1st European Dependable Computing Conference, EDCC-1 1994 - Berlin, Germany
Duration: Oct 4 1994Oct 6 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume852 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st European Dependable Computing Conference, EDCC-1 1994
CountryGermany
CityBerlin
Period10/4/9410/6/94

Fingerprint

Restriction
Stochastic systems
Random processes
Petri nets
Stochastic Petri Nets
Tractability
Modeling
Stochastic Systems
Stochastic Processes
Timing
Analytical Solution
Generalise
Model
Concepts

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bobbio, A., & Telek, M. (1994). Computational restrictions for SPN with generally distributed transition times. In Dependable Computing - EDCC-1 - 1st European Dependable Computing Conference, Proceedings (pp. 131-148). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 852 LNCS). Springer Verlag.

Computational restrictions for SPN with generally distributed transition times. / Bobbio, Andrea; Telek, M.

Dependable Computing - EDCC-1 - 1st European Dependable Computing Conference, Proceedings. Springer Verlag, 1994. p. 131-148 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 852 LNCS).

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

Bobbio, A & Telek, M 1994, Computational restrictions for SPN with generally distributed transition times. in Dependable Computing - EDCC-1 - 1st European Dependable Computing Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 852 LNCS, Springer Verlag, pp. 131-148, 1st European Dependable Computing Conference, EDCC-1 1994, Berlin, Germany, 10/4/94.
Bobbio A, Telek M. Computational restrictions for SPN with generally distributed transition times. In Dependable Computing - EDCC-1 - 1st European Dependable Computing Conference, Proceedings. Springer Verlag. 1994. p. 131-148. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bobbio, Andrea ; Telek, M. / Computational restrictions for SPN with generally distributed transition times. Dependable Computing - EDCC-1 - 1st European Dependable Computing Conference, Proceedings. Springer Verlag, 1994. pp. 131-148 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{050e3454f5d648b19014f319dbd00ac7,
title = "Computational restrictions for SPN with generally distributed transition times",
abstract = "The analysis of stochastic systems with non-exponential timing requires the development of suitable modeling tools. Recently, some effort has been devoted to generalize the concept of Stochastic Petri nets, by allowing the firing times to be generally distributed. The evolution of the PN in time becomes a stochastic process, for which in general, no analytical solution is available. The paper describes suitable restrictions of the PN model with generally distributed transition times, that have appeared in the literature, and compares these models from the point of view of the modeling power and the numerical tractability.",
author = "Andrea Bobbio and M. Telek",
year = "1994",
month = "1",
day = "1",
language = "English",
isbn = "9783540584261",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "131--148",
booktitle = "Dependable Computing - EDCC-1 - 1st European Dependable Computing Conference, Proceedings",

}

TY - GEN

T1 - Computational restrictions for SPN with generally distributed transition times

AU - Bobbio, Andrea

AU - Telek, M.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - The analysis of stochastic systems with non-exponential timing requires the development of suitable modeling tools. Recently, some effort has been devoted to generalize the concept of Stochastic Petri nets, by allowing the firing times to be generally distributed. The evolution of the PN in time becomes a stochastic process, for which in general, no analytical solution is available. The paper describes suitable restrictions of the PN model with generally distributed transition times, that have appeared in the literature, and compares these models from the point of view of the modeling power and the numerical tractability.

AB - The analysis of stochastic systems with non-exponential timing requires the development of suitable modeling tools. Recently, some effort has been devoted to generalize the concept of Stochastic Petri nets, by allowing the firing times to be generally distributed. The evolution of the PN in time becomes a stochastic process, for which in general, no analytical solution is available. The paper describes suitable restrictions of the PN model with generally distributed transition times, that have appeared in the literature, and compares these models from the point of view of the modeling power and the numerical tractability.

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

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

M3 - Conference contribution

AN - SCOPUS:84889157590

SN - 9783540584261

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 131

EP - 148

BT - Dependable Computing - EDCC-1 - 1st European Dependable Computing Conference, Proceedings

PB - Springer Verlag

ER -