Nested emptiness search for generalized büchi automata

Proceedings - Fourth International Conference on Application of Concurrency to System Design, ACSD 2004

Volumn , Issue , 2004, Pages 165-174

  Tauriainen, Heikki ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BÜCHI WORD AUTOMATA; FINITE STATE SYSTEMS; SPACE EXPLOSION; TEMPORAL LOGIC MODEL;

ALGORITHMS; AUTOMATION; CONSTRAINT THEORY; FORMAL LOGIC; MATHEMATICAL MODELS; PROBLEM SOLVING;

AUTOMATA THEORY;

EID: 10444272460     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSD.2004.1309129     Document Type: Conference Paper

References (25)

1. S. Aggarwal, C. Courcoubetis, and P. Wolper. Adding liveness properties to coupled finite-state machines. ACM Transactions on Programming Languages and Systems, 12(2):303-339, 1990.
2. D. Bošnački. A nested depth first search algorithm for model checking with symmetry reduction. In D. A. Peled and M. Y. Vardi, editors, Proceedings of the 22nd IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE 2002), number 2529 in Lecture Notes in Computer Science, pages 65-80. Springer-Verlag, 2002.
3. D. Bošnački. A light-weight algorithm for model checking with symmetry reduction and weak fairness. In T. Ball and S. K. Rajamani, editors, Proceedings of the 10th International SPIN Workshop on Model Checking Software (SPIN 2003), volume 2648 of Lecture Notes in Computer Science, pages 89-103. Springer-Verlag, 2003.
4. L. Brim, I. Černá, and M. Nečesal. Randomization helps in LTL model checking. In L. de Luca and S. Gilmore, editors, Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV 2001), volume 2165 of Lecture Notes in Computer Science, pages 105-119. Springer-Verlag, 2001.
5. Y. Choueka. Theories of automata on ω-tapes: A simplified approach. Journal of Computer and System Sciences, 8(2):117-141, 1974.
6. E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.
7. 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.
8. J.-M. Couvreur. On-the-fly verification of linear temporal logic. In J. M. Wing, J. Woodcock, and J. Davies, editors, Proceedings of the FM'99 World Congress on Formal Methods in the Development of Computing Systems, Volume I, volume 1708 of Lecture Notes in Computer Science, pages 253-271. Springer-Verlag, 1999.
9. S. Edelkamp, S. Leue, and A. Lluch-Lafuente. Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology Transfer (STTT), 5(2-3):247-267, 2004.
10. E. A. Emerson and A. P. Sistla. Deciding full branching time logic. Information and Control, 61(3):175-201, 1984.
11. N. Francez. Fairness. Texts and Monographs in Computer Science. Springer-Verlag, 1986.
12. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In G. Berry, H. Comon, and A. Finkel, editors, Proceedings of the 13th International Conference on Computer Aided Verification (CAV 2001), volume 2102 of Lecture Notes in Computer Science, pages 53-65. Springer-Verlag, 2001.
13. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In P. Dembinski and M. Sredniawa, editors, Proceedings of the 15th IFIP WG6.1 International Symposium on Protocol Specification, Testing, and Verification (PSTV 1995), pages 3-18. Chapman & Hall, 1995.
14. D. Giannakopoulou and F. Lerda. From states to transitions: Improving translation of LTL formulae to Büchi automata. In D. A. Peled and M. Y. Vardi, editors, Proceedings of the 22nd IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE 2002), volume 2529 of Lecture Notes in Computer Science, pages 308-326. Springer-Verlag, 2002.
15. P. Godefroid and G. J. Holzmann. On the verification of temporal properties. In A. A. S. Danthine, G. Leduc, and P. Wolper, editors, Proceedings of the 13th IFIP TC6/WG6.1 International Symposium on Protocol Specification, Testing, and Verification (PSTV 1993), pages 109-124. North-Holland, 1993.
16. P. Godefroid, G. J. Holzmann, and D. Pirottin. State space caching revisited. Formal Methods in System Design, 7(3):227-241, 1995.
17. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
18. G. J. Holzmann. An analysis of bitstate hashing. Formal Methods in System Design, 13(3):289-307, 1998.
19. G. J. Holzmann, D. Peled, and M. Yannakakis. On nested depth-first search. In J.-C. Grégoire, G. J. Holzmann, and D. A. Peled, editors, Proceedings of the Second Workshop on the SPIN Verification System, volume 32 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1997.
20. Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. In K. G. Larsen, S. Skyum, and G. Winskel, editors, Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP 1998), volume 1443 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, 1998.
21. T. Latvala and K. Heljanko. Coping with strong fairness. Fundamenta Informaticae, 43(1-4):175-193, 2000.
22. U. Stern and D. Dill. A new scheme for memory-efficient probabilistic verification. In R. Gotzhein and J. Bredereke, editors, Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques and Protocol Specification, Testing and Verification (FORTE/PSTV 1996), pages 333-348. Kluwer, 1996.
23. H. Tauriainen. On translating linear temporal logic into alternating and nondeterministic automata. Research Report A83, Helsinki University of Technology, Laboratory for Theoretical Computer Science, 2003.
24. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the Symposium on Logic in Computer Science (LICS 1986), pages 332-344. IEEE Computer Society Press, 1986.
25. P. Wolper and D. Leroy. Reliable hashing without collision detection. In C. Courcoubetis, editor, Proceedings of the 5th International Conference on Computer Aided Verification (CAV 1993), volume 697 of Lecture Notes in Computer Science, pages 59-70. Springer-Verlag, 1993.