Prod 3.2: An advanced tool for efficient reachability analysis

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

Volumn 1254, Issue , 1997, Pages 472-475

  Varpaaniemi, Kimmo ^a   Heljanko, Keijo ^a   Lilius, Johan ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

CTL MODEL; DIGITAL SYSTEMS LABORATORY; INDUSTRIAL PROJECTS; ON-THE FLY VERIFICATION; PREDICATE/TRANSITION NET; REACHABILITY; REACHABILITY ANALYSIS; REACHABILITY GRAPHS;

MODEL CHECKING;

EID: 84947429340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63166-6_51     Document Type: Conference Paper

References (13)

1. Tuomas Aura. Modelling the Needham-SchrSder authentication protocol with high level Petri nets. Technical Report B14, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, September 1995.
2. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1(2/3):275-288, 1992.
3. K. Heljanko. Model Checking the Branching Time Temporal Logic CTL. Research Report A45, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1997.
4. N. Husberg. SDL Modelling with High Level Petri Nets. In Proceedings of the Fifth International Workshop on Concurency, Specification & Programming (CSP), Berlin, Germany, September 25-27, 1996, pages 85-96, Berlin, 1996. Humboldt-University Berlin.
5. Tino Pyssysalo. Proving Properties of a New High Speed Data Bus with Predicate/Transition Nets. Microprocessing and Mieroprogramming, 40:791-794, 1994.
6. Tino Pyssysalo. The Modeling and Analysis of the Frame Synchronized Ring Using the Predicate/Transition Net Formalism. In Proceedings of COST 24 7 Meeting, Berlin, Germany, February 9-10, 1995, page 6, Berlin, 1995. Humboldt-University Berlin.
7. Tino Pyssysalo. An Induction Theorem for Ring Protocols of Processes Described with Predicate/Transition Nets. Research Report A37, Digital Systems Laboratory, Helsinki University of Technology, 1996.
8. Tino Pyssysalo and Leo Ojala. Modelling of a "Video on Demand" System Using Pr/T-Net Formalism--a Case Study. In Proceedings of the Third International Workshop on Concurency, Specification 8r Programming (CSP), Berlin, Germany, October 12-14, 1994, page 8, Berlin, 1994. Humboldt-University Berlin.
9. Tino Pyssysalo and Leo Ojala. Causal Modeling of a Video on Demand System Using Predicate/Transition Net Formalism. In Proceedings of the 22nd Euromicro Conferenee, Prague, Czech Republik, September 2-5, 1996, page 6, Los Alamitos, California, 1996. The Institute of Electrical and Electronics Engineers (IEEE) Computer Society Press.
10. A. Valmari. Alleviating state explosion during verification of behavioral equivalence. Report A-1992-3, University of Helsinki, Department of Computer Science, 1992.
11. A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design, 1(4):297-322, 1992.
12. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of LICS'86, pages 332-344. IEEE Computer Society Press, 1986.
13. Kimmo Varpaaniemi, Jaakko Halme, Kari Hiekkanen, and Tino Pyssysalo. PROD reference manual. Technical Report B13, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1995.