Coping with strong fairness

Fundamenta Informaticae

Volumn 43, Issue 1-4, 2000, Pages 175-193

  Latvala, Timo ^a   Heljanko, Keijo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Counterexamples; Fairness; Model checking; Streett automata; Verification

Indexed keywords

EID: 0042705559     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-2000-43123409     Document Type: Article

References (19)

1. Clarke E., Grumberg O., McMilllan K. and Zhao, X.: Efficient Generation Counterexamples and Witnesses in Symbolic Model Checking. Technical Report TR CMU-CS-94-204, Carnegie Mellon University, School of Computer Science, Pittsburg, 1994.
2. Courcoubetis, C., Vardi, M., Wolper, P. and Yannakakis, M.: Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design, vol 1. pp. 275-288, 1992.
3. Couvreur, J.-M.: On-the-fly Verification of Linear Temporal Logic. In Proceedings of the World Congress on Formal Methods in the Development of Computing Systems (FM'99), Volume I, pp. 253-271, Springer, 1999. LNCS 1708.
4. Emerson, E.A. and Lei, C-L.: Modalities for Model Checking: Branching Time Logic Strikes Back. Science of Computer Programming, vol. 8, no. 3, pp 275-306, 1987.
5. Francez, N.: Fairness. Springer Verlag, New York, 1986.
6. Gerth, R., Peled, D., Vardi, M.Y. and Wolper, P.: Simple On-the-fly Automatic Verification of Linear Temporal Logic. Proceedings of the 15th Workshop on Protocol Specification, Testing and Verification, pp. 3-18. Chapman and Hall, Warsaw Poland, 1995.
7. Heljanko, K.: Model Checking the Branching Time Temporal Logic CTL. Research Report A45 Digital Systems Laboratory, Helsinki University of Technology, 1997.
8. Hojati, R., Singhal, V., and Brayton, R.K.: Edge-Strett/ Edge-Rabin Automata Environment for Formal Verification Using Language Containment. Memorandum No. UCB/ERL M94/12, Electronics Res. Lab., Cory Hall, University of California, Berkeley, 1994.
9. Kesten Y., Pnueli, A. and Raviv, L.: Algorithmic Verification of Linear Temporal Properties. In Proceedings of the 25th International Colloquium on Automata, Languages, and Programming (ICALP 1998), Lecture Notes in Computer Science, vol. 1443, pp. 1-16. Springer-Verlag, 1998.
10. Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton, New Jersey, 1994.
11. Lichtenstein, O. and Pnueli, O.: Checking that finite state concurrent programs satisfy their linear specifications. Proc. 12th ACM Symp. Princ. of Prog. Lang., pp 97-107, 1985.
12. Reisig, W.: Elements of Distributed Algorithms, Springer Verlag, Berlin Heidelberg, 1998.
13. Rauch Henzinger, M., Telle, J.: Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT'96), pp. 10-20. 1997.
14. Safra, S.: Complexity of Automata on Infinite Objects, PhD Thesis, The Weizmann Institute of Science, 1989.
15. Sherman, R., Pnueli, A. and Harel, D.: Is the Interesting Part of Process Logic Uninteresting: a Translation From PL to PDL. SIAM Journal on Computing, vol. 13, no. 4, pp. 825-839, 1984.
16. Tarjan, R.: Depth-First Search and Linear Graph Algorithms. SIAM Journal of Computing, vol. 1, no. 2, pp 146-160, 1972.
17. Thomas, W.: Languages, Automata and Logic, in: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, Eds.). Vol III, pp. 385-455, Springer-Verlag, New York, 1997.
18. Valmari, A.: The State Explosion Problem, in: Lectures on Petri Nets I: Basic Models, pp. 429-528, Springer, 1998. LNCS 1491.
19. Vardi, M.Y., Wolper, P.: Reasoning About Infinite Computations. Information and Computation, vol. 115, no. 1, pp. 1-37, 1994.