Computational Analysis of a Power Distribution System with Petri Nets
Petri nets provide a simple yet very intuitive graphical model for processes such as concurrency, parallelism and synchronization. Furthermore, they have a solid mathematical foundation and a number of analysis methods available. Due to these reasons, Petri nets are especially suited for the analysis of large and complex systems. In this paper we apply the Petri nets formalism to represent and analyze a power distribution system. To this aim, we report briefly a Mathematica package developed by the authors to deal with Petri nets. The package is subsequently applied to determine the possible scenarios of a failure of the system and some associated behaviors.
KeywordsMathematica Package Reachability Graph Reachability Problem Primary Failure Output Place
Unable to display preview. Download preview PDF.
- 5.Iglesias, A.: Software Verification and Validation of Graphical Web Services in Digital 3D Worlds. In: Communications in Computer and Information Science. CCIS, vol. 56, pp. 293–300 (2009)Google Scholar
- 6.Iglesias, A.: Pure Petri Nets for Software Verification and Validation of Semantic Web Services in Graphical Worlds. International Journal of Future Generation Communication and Networking 3(1), 33–46 (2010)Google Scholar
- 9.Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: Proc. 14th Annual ACM Symp. Theory Computing, pp. 267–281 (1982)Google Scholar
- 10.Lipton, R.: The reachability problem requires exponential space.Technical report, Computer Science Department, Yale University (1976)Google Scholar
- 11.Luengo, F., Iglesias, A.: Designing an Action Selection Engine for Behavioral Animation of Intelligent Virtual Agents. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3482, pp. 1157–1166. Springer, Heidelberg (2005)CrossRefGoogle Scholar