Titlebook: Stochastic Discrete Event Systems; Modeling, Evaluation Armin Zimmermann Book 2008 Springer-Verlag Berlin Heidelberg 2008 Performance Model

不规则的跳动

Armin ZimmermannCoherent and comprehensive overview on modeling with and quantitative evaluation of stochastic discrete event systems.Important model classes like queuing networks, Petri nets and automata are present

减弱不好

持续

https://doi.org/10.1007/978-3-540-74173-2Performance Modeling; Petri Nets; Queuing Models; Stochastic Automata; System Optimization; System Perfor

软膏

978-3-642-09350-0Springer-Verlag Berlin Heidelberg 2008

neutralize

Introductionime of a technical system. Model‐based evaluation of technical systems has turned out to be a powerful and inexpensive way of predicting properties before the actual implementation. Costly design changes can thus be minimized, and the planning time is reduced. A model is a simplified representation

同步左右

A Unified Description for Stochastic Discrete Event Systemss are captured in the SDES definition. From an implementation‐oriented point of view one can also think of the SDES definition as a blueprint for an abstract data type with virtual elements, which are instantiated for a certain model class by substituting the attributes with net‐class dependent valu

使无效

Stochastic Timed Automataard automata describe states and state transitions without a notion of time. Delays of actions (interevent times) are associated to events and their associated state transitions in timed automata, for which the performance can then be evaluated. In a stochastic timed automaton, the interevent times

出没

Queuing Modelst money, and it is therefore not economically reasonable to have too many of them. On the other hand, customers often request service in an unknown and stochastic pattern, which means that an infinite number of servers would be required in theory to fulfill all requests in parallel.

Spinal-Tap

Simple Petri Netsof them is that they contain places (depicted by circles), transitions (depicted by boxes or bars), and directed arcs connecting them. A Petri net can thus be mathematically classified as a directed, bipartite graph. Places may hold tokens, and a certain assignment of tokens to the places of a model

legacy

Colored Petri Netsns need to be structured and specified, resulting in colors (or types). Numbers as arc information are no longer sufficient as in simple Petri nets. Transition firings may depend on token attribute values and change them at firing time. A transition might have different modes of enabling and firing