Gspn [patched]

: A finite set of (both timed and immediate) representing events.

: The , which dictates the starting distribution of tokens within the places. : A finite set of (both timed and

Represent logical actions or structural changes that occur instantly with zero time delay. These take absolute priority over timed transitions and are represented as thin black lines. Mathematical Formalism A GSPN is formally defined as a 6-tuple structure: These take absolute priority over timed transitions and

: Performance evaluation of computer systems, fault-tolerant systems, manufacturing workcells, communication protocols, and any system with concurrency, contention, and exponentially distributed events. | | State space explosion | Number of

| Type | Symbol | Timing | Weight | Priority | |------|--------|--------|--------|----------| | (exponential) | Filled white bar | Random delay ~ exp(rate) | Rate λ | Low | | Immediate | Thin black bar | Zero delay | Probabilistic weight | High |

| Limitation | Explanation | |------------|-------------| | | Only exponential distributions (though phase-type approximations can generalize). | | State space explosion | Number of markings grows combinatorially with tokens/places. | | No data types | Tokens are indistinguishable (unlike colored Petri nets). | | No priorities (except immediate/timed) | Cannot model arbitrary deterministic delays without extensions (e.g., DSPN). | | Steady-state required | Transient analysis is more computationally expensive. |

In computer science, system engineering, and performance evaluation, a is a mathematical modeling tool used to analyze concurrent, asynchronous, and distributed systems. Architectural Components