Symbolic Methods for the State Space Exploration of GSPN Models [chapter]

Ian Davies, William J. Knottenbelt, Pieter S. Kritzinger
2002 Lecture Notes in Computer Science  
Generalised Stochastic Petri Nets (GSPNs) suffer from the same problem as any other state-transition modelling technique: it is difficult to represent sufficient states so that general, real life systems can be analysed. In this paper we use symbolic techniques to perform state space exploration for unstructured GSPNs. We present an algorithm for finding an encoding function which attempts to minimize the height of BDDs used to encode GSPN state spaces. This technique brings together and
more » ... a spectrum of ad-hoc heuristics in a formal algorithm. We also develop a BDD state exploration algorithm which incorporates an adjustable memory threshold. Our results show the ability to encode over 10 8 states using just 13.7MB of memory.
doi:10.1007/3-540-46029-2_12 fatcat:w2gquvi46neizd73ayxjeux5ii