Testing Spin’s LTL formula conversion into Büchi automata with randomly generated input

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

Volumn 1885, Issue , 2000, Pages 54-72

  Tauriainen, Heikki ^a   Heljanko, Keijo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DISTRIBUTED COMPUTER SYSTEMS; TEMPORAL LOGIC;

AUTOMATA-THEORETIC APPROACH; CONVERSION ALGORITHM; CRITICAL SYSTEMS; LINEAR TEMPORAL LOGIC; LTL MODEL-CHECKING; MODEL CHECKING TOOLS; RANDOM TESTING; REACTIVE SYSTEM;

MODEL CHECKING;

EID: 84947217604     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722468_4     Document Type: Conference Paper

References (16)

1. G. Bhat, R. Cleaveland, and O. Grumberg. Efficient on-the-fly model checking for CTL*.In Proceedings of 10th Annual IEEE Symposium on Logic in Computer-Science (LICS'95), pages 388-397. IEEE Computer Society Press, 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:275-288, 1992.
3. M. Daniele, F. Giunchiglia, and M. Y. Vardi. Improved automata generation for linear temporal logic. In Proceedings of the 11th International Conference on Computer Aided Verification (CAV'99), pages 249-260. Springer, 1999. LNCS 1633.
4. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proceedings of 15th Workshop Protocol Specification, Testing, and Verification, pages 3-18, 1995.
5. G. Holzmann. On-the-fly, LTL model checking with Spin. URL: http://netlib.bell-labs.com/netlib/spin/whatispin.html.
6. G. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
7. E. Clarke Jr., O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
8. O. Kupferman and M. Y. Vardi. Model checking of safety properties. In Proceedings of 11th International Conference on Computer Aided Verification (CAV'99), pages 172-183. Springer, 1999. LNCS 1633.
9. J. Lilius. ASA: The Abo System Analyser, September 1999. URL: http://www.abo.fi/Y/07Ejolilius/mc/aasa.html.
10. M. Ronkko. A distributed object oriented implementation of an algorithm converting a LTL formula to a generalised Büchi automaton, 1998. URL: http:/www.abo.fi/\%7Emauno.ronkko/ASA/ltlalg.html.
11. S. Safra. Complexity of automata on infinite objects. PhD thesis, The Weizmann Institute of Science, 1989.
12. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, June 1972.
13. H. Tauriainen. A randomized testbench for algorithms translating linear temporal logic formulae into Buichi automata. In Proceedings ofthe Workshop Concurrency, Specification and Programming 1999 (CS&P'99), pages 251-262. Warsaw University, September 1999.
14. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, pages 238-265, 1996. LNCS 1043.
15. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the 1st IEEE Symposium on Logic in Computer Science (LICS'86), pages 332-344. IEEE Computer Society Press, 1986.
16. K. Varpaaniemi, K. Heljanko, and J. Lilius. PROD 3.2 - An advanced tool for efficient reachability analysis. In Proceedings of the 9th International Conference on Computer Aided Verification (CAV'97), pages 472-475. Springer, June 1997.LNCS 1254.