Abstract
This paper presents the high level Petri nets analyzer Helena. Helena can be used for the on-the-fly verification of state properties, i.e., properties that must hold in all the reachable states of the system, and deadlock freeness. Some features of Helena make it particularly efficient in terms of memory management. Structural abstractions techniques, mainly transitions agglomerations, are used to tackle the state explosion problem. Benchmarks are presented which compare our tool to Maria.
Helena is developed in portable Ada and is freely available under the conditions of the GNU General Public License.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Evangelista, S., Kaiser, C., Pradat-Peyre, J.F., Rousseau, P.: Quasar: a new tool for analyzing concurrent programs. In: Rosen, J.-P., Strohmeier, A. (eds.) Ada-Europe 2003. LNCS, vol. 2655, pp. 168–181. Springer, Heidelberg (2003)
Mäkelä, M.: Maria: modular reachability analyser for algebraic system nets. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 434–444. Springer, Heidelberg (2002)
Varpaaniemi, K.: PROD 3.4.00 — an advanced tool for efficient reachability analysis. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, Software (2004)
Mäkelä, M.: Condensed storage of multi-set sequences. In: Practical Use of High-Level Petri Nets, University of Århus, Denmark. DAIMI report PB, vol. 547, pp. 111–125 (2000)
Holzmann, G.J.: The model checker spin. IEEE Transactions on Software Engineering 23(5), 279–295 (1997)
Mäkelä, M.: Applying compiler techniques to reachability analysis of high-level models. In: Workshop on Concurrency, Specification & Programming 2000, Informatik-Bericht, Humboldt-Universität zu Berlin, Germany. vol. 140, pp. 129–142 (2000)
Evangelista, S., Pradat-Peyre, J.F.: An efficient algorithm for the enabling test of colored petri nets. In: Fifth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, University of Århus, Denmark. DAIMI report PB, vol. 570, pp. 137–156 (2004)
Dutheillet, C., Haddad, S.: Conflict sets in colored petri nets. In: Proceedings of the 5th International Workshop on Petri Nets and Performance Models, pp. 76–85 (1993)
Evangelista, S.: Syntactical rules for colored petri nets manipulation. Technical Report 641, Cedric, CNAM (2004), http://cedric.cnam.fr
Mäkelä, M.: Optimising enabling tests and unfoldings of algebraic system nets. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 283–302. Springer, Heidelberg (2001)
Evangelista, S., Pradat-Peyre, J.F.: Efficient state space storage in explicit model checking. Technical Report 682, Cedric, CNAM (2004), http://cedric.cnam.fr/
Visser, W.: Memory efficient state storage in spin. In: Proceedings of the Second Spin Workshop (1996)
Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 254, pp. 359–376. Springer, Heidelberg (1987)
Haddad, S.: A reduction theory for colored nets. In: Rozenberg, G. (ed.) APN 1989. LNCS, vol. 424, pp. 399–425. Springer, Heidelberg (1990)
Chiola, G., Franceschinis, G., Gaeta, R., Ribaudo, M.: Greatspn 1.7: graphical editor and analyzer for timed and stochastic petri nets. Performance Evaluation 24(1-2), 47–68 (1995)
Duret-Lutz, A., Poitrenaud, D.: Spot: an extensible model checking library using transition-based generalized Büchi automata. In: Proceedings of the 12th IEEE/ACM International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2004), pp. 76–83. IEEE Computer Society Press, Los Alamitos (2004)
Valmari, A.: On-the-fly verification with stubborn sets. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 397–408. Springer, Heidelberg (1993)
Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)
Kristensen, L.M., Valmari, A.: Finding stubborn sets of coloured petri nets without unfolding. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol. 1420, pp. 104–123. Springer, Heidelberg (1998)
Beaudouin-Lafon, M., Mackay, W.E., Jensen, M., Andersen, P., Janecek, P., Lassen, M., Lund, K., Mortensen, K., Munck, S., Ratzer, A., Ravn, K., Christensen, S., Jensen, K.: CPN/tools: A tool for editing and simulating coloured petri nets. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, p. 574. Springer, Heidelberg (2001)
Haddad, S., Pradat-Peyre, J.F.: New powerfull Petri nets reductions. Technical report, Cedric, CNAM (2003), http://cedric.cnam.fr/
Evangelista, S., Haddad, S., Pradat-Peyre, J.F.: New coloured reductions for software validation. In: Proccedings of the 7th International workshop on discrete event systems, pp. 355–360 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Evangelista, S. (2005). High Level Petri Nets Analysis with Helena. In: Ciardo, G., Darondeau, P. (eds) Applications and Theory of Petri Nets 2005. ICATPN 2005. Lecture Notes in Computer Science, vol 3536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494744_26
Download citation
DOI: https://doi.org/10.1007/11494744_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26301-2
Online ISBN: 978-3-540-31559-9
eBook Packages: Computer ScienceComputer Science (R0)