Model checking safety properties in modular high-level nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2679, Issue , 2003, Pages 201-220

  Mäkelä, Marko ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

High level nets; Model checking; Modular systems; State space enumeration

Indexed keywords

PETRI NETS;

ANALYSIS METHOD; DISTRIBUTED EVENTS; HIGH-LEVEL NETS; MODULAR SYSTEM; REDUCTION METHOD; SAFETY PROPERTY; SIMPLE ALGORITHM; STATE-SPACE ANALYSIS;

MODEL CHECKING;

EID: 35248856853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44919-1_15     Document Type: Article

References (19)

1. Eugenio Battiston, Fiorella De Cindio, and Giancarlo Mauri. Modular algebraic nets to specify concurrent systems. IEEE Transactions on Software Engineering, 22(10):689-705, October 1996.
2. Jonathan Billington et al. High-level Petri nets - concepts, definitions and graphical notation, version 4.7.3. Final Draft International Standard ISO/IEC 15909, ISO/IEC JTC1/SC7, Genève, Switzerland, May 2002.
3. Shing Chi Cheung and Jeff Kramer. Checking safety properties using compositional reachability analysis. ACM TOSEM, 8(1):49-78, January 1999.
4. th International Conference, volume 935 of Lecture Notes in Computer Science, pages 201-217, Turin, Italy, June 1995. Springer-Verlag.
5. Søren Christensen and Laure Petrucci. Modular analysis of Petri nets. The Computer Journal, 43(3):224-242, 2000.
6. Danny Dolev, Maria Klawe, and Michael Rodeh. An O(n log n) unidirectional distributed algorithm for extrema finding in a circle. Journal of Algorithms, 3(3):245-260, September 1982.
7. Orna Grumberg and David E. Long. Model checking and modular verification. ACM TOPLAS, 16(3):843-871, May 1994.
8. Gerard J. Holzmann. Spin-formal verification, http://spinroots.com/.
9. Specification and description language (SDL). Recommendation Z. 100 (08/02), International Telecommunication Union, Geneva, Switzerland, September 2002.
10. Eric Y. T. Juan, Jeffrey J. P. Tsai, and Tadao Murata. Compositional verification of concurrent systems using Petri-net-based condensation rules. ACM TOPLAS, 20(5):917-979, September 1998.
11. th International SPIN Workshop, volume 1885 of Lecture Notes in Computer Science, pages 34-53, Stanford, CA, USA, August 2000. Springer-Verlag.
12. th International Conference (CAV99), volume 1633 of Lecture Notes in Computer Science, pages 172-183, Trento, Italy, July 1999. Springer-Verlag.
13. nd International Conference, volume 2075 of Lecture Notes in Computer Science, pages 283-302, Newcastle upon Tyne, England, June 2001. Springer-Verlag.
14. Marko Mäkelä. Efficiently verifying safety properties with idle office computers. In Charles Lakos, Robert Esser, Lars M. Kristensen, and Jonathan Billington, editors, Formai Methods in Software Engineering and Defence Systems 2002, volume 12 of Conferences in Research and Practice in Information Technology, pages 11-16, Adelaide, Australia, June 2002. Australian Computer Society Inc.
15. rd International Conference, volume 2360 of Lecture Notes in Computer Science, pages 434-444, Adelaide, Australia, June 2002. Springer-Verlag.
16. th World Multiconference on Systemics, Cybernetics and Informatics, volume VIII, pages 684-688, Orlando, FL, USA, July 2000. International Institute of Informatics and Systemics.
17. th International Conference (CAV97), volume 1254 of Lecture Notes in Computer Science, pages 256-267, Haifa, Israel, June 1997. Springer-Verlag.
18. Antti VaLmari. The state explosion problem. In Wolfgang Reisig and Grzegorz Rozenberg, editors, Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science, pages 429-528. Springer-Verlag, 1998.
19. Wei Jen Yeh and Michal Young. Compositional reachability analysis using process algebra. In Proceedings of the Symposium on Software Testing, Analysis, and Verification, pages 49-59, Victoria, British Columbia, October 1991. ACM Press.