Logo

examples

data structures and software dependability

computer science department

brandenburg university of technology cottbus - senftenberg

FMS

Description - Model Specification - Analysis


Description

A flexible manufacturing system with three machines published in [ CT93 ]. The original model is a GSPN with self-modifying arcs. The model is scalable by the initial amount of tokens N on places P1,P2,P3 and P12. The models below are restricted to an initial amount of tokens of maximal 10. Each of the transitions tP1s, tP2s and tP3s have been modeled by 10 different transitions , each representing a unique token assignment of the places P1s, P2s and P3s. This is required since Snoopy and Marcie do not support marking-dependent arcs weights.

For reasons of efficiency it is worth to reduce the GSPN to an SPN as proposed in [ MBC+95 ].


Model specification

Snoopy - APNN* - Rewards


Snoopy model for GSPN version with N=5

APNN* model for the GSPN version (fsm_gspn_N_le_10.apnn)

APNN* model for the SPN version (fsm_spn_N_le15.apnn)


Reward structures for the GSPN (fsm_gspn.rw)

Reward structures for the SPN (fsm_spn.rw)


Analysis

Reachability graph of the SPN model

Nstatesstate transitions
28103,699
435,910237,120
6537,7684,205,670
84,459,45538,533,968
1025,397,658234,523,289
12111,414,9401,078,917,632
14403,259,0404,047,471,180

CSL formulas

Productivity of the system.
Transient probability to have N tokens on place P1.

the end

Any comments or questions are welcome. Please direct them to monika [period] heiner [snail] b-tu [period] de Privacy Policy