High level Petri nets analysis with Helena

Lecture Notes in Computer Science

Volumn 3536, Issue , 2005, Pages 455-464

  Evangelista, Sami ^a  

^a Bioinformatique et Chimie Moléculaire   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BENCHMARKING; COMPUTER SOFTWARE PORTABILITY; COMPUTER SYSTEM RECOVERY; PROBLEM SOLVING;

DEADLOCK FREENESS; HIGH LEVEL PETRI NETS; STATE EXPLOSION PROBLEM; STRUCTURAL ABSTRACTIONS TECHNIQUES;

PETRI NETS;

EID: 26444560987     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11494744_26     Document Type: Conference Paper

References (22)

1. Evangelista S., Kaiser C., Pradat-Peyre J.F., and Rousseau P. Quasar: a new tool for analyzing concurrent programs. In Proceedings of the Ada-Europe International Conference on Reliable software technologies, volume 2655 of LNCS, pages 166-181. Springer, 2003.
2. Mäkelä M. Maria: modular reachability analyser for algebraic system nets. In Proceedings of the 23th International Conference on Application and Theory of Petri Nets, volume 2360 of LNCS, pages 434-444. Springer, 2002.
3. Varpaaniemi K. PROD 3.4.00 - an advanced tool for efficient reachability analysis. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, 2004. Software.
4. Marko Mäkelä. Condensed storage of multi-set sequences. In Practical Use of High-Level Petri Nets, number 547 in DAIMI report PB, pages 111-125. University of Arhus, Denmark, 2000.
5. Holzmann G.J. The model checker spin. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
6. Mäkelä M. Applying compiler techniques to reachability analysis of high-level models. In Workshop on Concurrency, Specification & Programming 2000, number 140 in Informatik-Bericht, pages 129-142. Humboldt-Universität zu Berlin, Germany, 2000.
7. Evangelista S. and 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, number 570 in DAIMI report PB, pages 137-156. University of Århus, Denmark, 2004.
8. Dutheillet C. and Haddad S. Conflict sets in colored petri nets. In Proceedings of the 5th International Workshop on Petri Nets and Performance Models, pages 76-85, 1993.
9. Evangelista S. Syntactical rules for colored petri nets manipulation. Technical Report 641, Cedric, CNAM, http://cedric.cnam.fr, 2004.
10. Mäkelä M. Optimising enabling tests and unfoldings of algebraic system nets. In Proceedings of the 22th International Conference on Application and Theory of Petri Nets, volume 2075 of LNCS, pages 283-302. Springer, 2001.
11. Evangelista S. and Pradat-Peyre J.F. Efficient state space storage in explicit model checking. Technical Report 682, Cedric, CNAM, http://cedric.cnam.fr/, 2004.
12. Visser W. Memory efficient state storage in spin. In Proceedings of the Second Spin Workshop, 1996.
13. Berthelot G. Transformations and decompositions of nets. In Advances in Petri Nets, volume 254 of LNCS, pages 359-376. Springer, 1986.
14. Haddad S. A reduction theory for colored nets. In Advances in Petri Nets, volume 424 of LNCS, pages 399-425. Springer, 1989.
15. Chiola G., Franceschinis G., Gaeta R., and Ribaudo M. Greatspn 1.7: graphical editor and analyzer for timed and stochastic petri nets. Performance Evaluation, 24(1-2):47-68, 1995.
16. Alexandre Duret-Lutz and Denis Poitrenaud. 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'04), pages 76-83. IEEE Computer Society Press, 2004.
17. Valmari A. On-the-fly verification with stubborn sets. In Proceedings of the 5th International Conference on Computer-Aided Verification, volume 697 of LNCS, pages 397-408. Springer.
18. Valmari A. The state explosion problem. Lectures on Petri Nets I: Basic Models, 1491:429-528, 1998.
19. Lars Michael Kristensen and Antti Valmari. Finding stubborn sets of coloured petri nets without unfolding. In Proceedings of the 19th International Conference on Application and Theory of Petri Nets, volume 1420 of LNCS, pages 104-123. Springer, 1998.
20. Michel Beaudouin-Lafon, Wendy E. Mackay, Mads Jensen, Peter Andersen, Paul Janecek, Michael Lassen, Kasper Lund, Kjeld Mortensen, Stephanie Munck, Anne Ratzer, Katrine Ravn, Soren Christensen, and Kurt Jensen. CPN/tools: A tool for editing and simulating coloured petri nets. In Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 574-pp. Springer, 2001.
21. Haddad S. and Pradat-Peyre J.F. New powerfull Petri nets reductions. Technical report, Cedric, CNAM, http://cedric.cnam.fr/, 2003.
22. Evangelista S., Haddad S., and Pradat-Peyre J.F. New coloured reductions for software validation. In Proceedings of the 7th International workshop on discrete event systems, pages 355-360, 2004.