A stubborn attack on state explosion

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

Volumn 531 LNCS, Issue , 1991, Pages 156-165

  Valmari, Antti ^a  

^a VTT TECHNICAL RESEARCH CENTRE OF FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; COMPUTER CIRCUITS; DISTRIBUTED COMPUTER SYSTEMS;

AUTOMATIC VERIFICATION; CONCURRENT SYSTEMS; LINEAR TEMPORAL LOGIC; LINEAR TIME TEMPORAL LOGIC; NUMBER OF STATE; REDUCED STATE SPACE GENERATION; REDUCED-STATE; TEMPORAL OPERATORS;

TEMPORAL LOGIC;

EID: 85016851732     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0023729     Document Type: Conference Paper

References (13)

1. Aho, A. V., Hopcroft, J. E. and Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts 1974, 470 p.
2. Brookes, S. D., Hoare, C. A. R. and Roscoe, A. W.: A Theory of Communicating Sequential Processes. Journal of the ACM 31 (3) 1984, pp. 560-599.
3. Clarke, E. M., Emerson, E. A. and Sistla, A. P.: Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems 8 (2) 1986 pp. 244-263.
4. Lamport, L.: What Good is Temporal Logic? Information Processing '83, North-Holland pp. 657-668.
5. Lichtenstein, O. and Pnueli, A.: Checking that Finite State Concurrent Programs Satisfy their Linear Specification. Proceedings of the Twelfth ACM Symposium on the Principles of Programming Languages, January 1985 pp. 97-107.
6. Overman, W. T.: Verification of Concurrent Systems: Function and Timing. Ph.D. Dissertation, University of California Los Angeles 1981, 174 p.
7. Pnueli, A.: Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends. In: Current Trends in Concurrency, Lecture Notes in Computer Science 224, Springer 1986 pp. 510-584.
8. Valmari, A.: Error Detection by Reduced Reachability Graph Generation. Proceedings of the Ninth European Workshop on Application and Theory of Petri Nets, Venice, Italy 1988 pp. 95-112.
9. Valmari, A.: Heuristics for Lazy State Generation Speeds up Analysis of Concurrent Systems. Proceedings of the Finnish Artificial Intelligence Symposium STeP-88, Helsinki 1988 Vol. 2 pp. 640-650.
10. Valmari, A.: State Space Generation: Efficiency and Practicality. Ph.D. Thesis, Tampere University of Technology Publications 55, 1988, 169 p.
11. Valmari, A.: Eliminating Redundant Interleavings during Concurrent Program Verification. Proceedings of Parallel Architectures and Languages Europe '89 Vol 2, Lecture Notes in Computer Science 366, Springer 1989 pp. 89-103.
12. Valmari, A.: Stubborn Sets for Reduced State Space Generation. Proceedings of the Tenth International Conference on Application and Theory of Petri Nets, Bonn, FRG 1989 Vol. 2 pp. 1-22. A revised version to appear in Advances in Petri Nets 90, Lecture Notes in Computer Science, Springer.
13. Wheeler, G. R., Valmari, A. and Billington, J.: Baby Toras Eats Philosophers but Thinks about Solitaire. Proceedings of the Fifth Australian Software Engineering Conference, Sydney, NSW, Australia, 1990 pp. 283-288.