Stochastic Petri Nets Sensitivity to Token Scheduling Policies

G. Balbo (), M. Beccuti (), M. Pierro () and G. Franceschinis ()
Additional contact information
G. Balbo: Università di Torino
M. Beccuti: Università di Torino
M. Pierro: Università di Torino
G. Franceschinis: Università del Piemonte Orientale “A. Avogadro”

A chapter in Operations Research Proceedings 2010, 2011, pp 181-186 from Springer

Abstract: Abstract Stochastic Petri Nets and their generalizations are powerful formalisms for the specification of stochastic processes. In their original definition they do not provide any specification for the token extraction order applied by a transition to its input places, however this aspect may be relevant if timed transitions are interpreted as servers and tokens as customers, so that the extraction order may be interpreted as a scheduling policy. In this paper we discuss how the token scheduling policies different from the Random Order one which is assumed by default, may be relevant for the computation of average performance indices.

Keywords: Service Time; Color Class; Service Time Distribution; Processor Share; Input Place (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-20009-0_29

Ordering information: This item can be ordered from
http://www.springer.com/9783642200090

DOI: 10.1007/978-3-642-20009-0_29

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().