Abstract
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 extends 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 108 states using just 13.7MB of memory.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Ajmone-Marsan, G. Conte, and G. Balbo. A class of Generalised Stochastic Petri Nets for the performance evaluation of multiprocessor systems. ACM Transactions on Computer Systems, 2:93–122, 1984.
A.S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. LNCS 1639, Proc. 20th Intl. Conf. of the Application and Theory of Petri Nets, pages 6–25, 1999.
B. Bollig and I. Wegener. Improving the variable ordering of OBBDs is NP-complete. IEEE Transactions on Computers, 45(9):993–1006, 1996.
B.R. Haverkort, A. Bell, H.C. Bohnenkamp. On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets. Proc. 8th Intl Conf. Petri Nets and Perf. Models (PNPM’99), pages 12–21, 1999.
R.E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computer Science, C-35(8):677–691, August 1986.
R.E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293–318, September 1992.
E. Pastor and J. Cortadella. Petri net analysis using boolean function manipulation. Technical Report, University of Zaragoza, 1993.
E. Pastor and J. Cortadella. Efficient Encoding Schemes for Symbolic Analysis of Petri nets. Proc. Design, Automation and Test in Europe, pages 790–795, 1998.
M. Fujita, P. McGeer, and J.-Y. Yang. Multi-terminal binary decision diagrams: an efficient data structure for matrix representations. Formal Methods in System Design, 10(2/3):149–169, 1997.
G. Ciardo, G. Luettgen, R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. ICASE Report No. 99-50, December 1999.
H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains. In Proc. 3rd Int. Workshop on the Num. Solution of Markov Chains, pages 188–207, 1999.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, L.J. Hwang. Symbolic Model Checking: 1020 States and Beyond. Proc. 5th IEEE Symp. on Logic in Computer Science, pages 428–439, 1990.
W. Knottenbelt. Generalised Markovian Analysis of Timed Transition Systems. Master’s thesis, University of Cape Town, June 1996.
K.S. Brace, R.L. Rudell, R.E. Bryant. Efficient implementation of a BDD package. 27th ACM/IEEE Design Automation Conference, pages 40–45, 1990.
O. Coudert, C. Berthet, J-C. Madre. Verification of Sequential Machines Using Boolean Functional Vectors. Applied Formal Methods For Correct VLSI Design, 1:111–128, 1990.
P. Buchholz, G. Ciardo, S. Donatelli and P. Kemper. Kronecker operations and sparse matrices with applications to the solution of Markov models. ICASE Report No. 97-66, December 1997.
P.S. Kritzinger and F. Bause. Stochastic Petri Nets: An Introduction to the Theory. Verlag Vieweg, Wiesbaden, Germany, 1995.
R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hactel, E. Macii, A. Pardo, F. Somenzi. Algebraic Decision Diagrams and their Applications. In Proc. International Conf. Computer-Aided Design (ICCAD), pages 188–191, 1993.
S. Caselli, G. Conte, P. Marenzoni. Parallel State Space Exploration for GSPN Models. LNCS 935, Proc. 16th Intl Conference on the Application and Theory of Petri Nets, pages 181–200, June 1995.
W.J. Knottenbelt, P.G. Harrison, M.A. Mestern, P.S. Kritzinger. A probabilistic dynamic technique for the distributed generation of very large state spaces. Performance Evaluation, pages 127–148, February 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davies, I., Knottenbelt, W.J., Kritzinger, P.S. (2002). Symbolic Methods for the State Space Exploration of GSPN Models. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds) Computer Performance Evaluation: Modelling Techniques and Tools. TOOLS 2002. Lecture Notes in Computer Science, vol 2324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46029-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-46029-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43539-6
Online ISBN: 978-3-540-46029-9
eBook Packages: Springer Book Archive