SPOT: An extensible model checking library using Transition-based Generalized Büchi Automata

Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

Volumn , Issue , 2004, Pages 76-83

  Duret Lutz, Alexandre ^a   Poitrenaud, Denis ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING LIBRARY; ON-THE-FLY COMPUTATIONS; SPOT; TRANSITION-BASED GENERALIZED BÜCHIN AUTOMATA (TGBA);

ALGORITHMS; AUTOMATION; COMPUTATIONAL METHODS; GRAPHIC METHODS; MATHEMATICAL MODELS; ROUTERS; USER INTERFACES;

C (PROGRAMMING LANGUAGE);

EID: 16244395169     PISSN: 15267539     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOT.2004.1348184     Document Type: Conference Paper

References (25)

1. S. Baarir, S. Haddad, and J.-M. Ilié. Exploiting partial symmetries in well-formed nets for the reachability and the linear time model checking problems. In Proc. of the 7th Workshop on Discrete Event Systems (WODES'04), Reims, France, September 2004. In press.
2. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. A symbolic reachability graph for coloured Petri nets. Theoretical Computer Science, 176(1-2):39-65, April 1997.
3. J.-M. Couvreur. On-the-fly verification of temporal logic. In J. M. Wing, J. Woodcock, and J. Davies, Eds., Proc. of the World Congress on Formal Methods in the Development of Computing Systems (FM'99), vol. 1708 of LNCS, pp. 253-271, Toulouse, France, September 1999. Springer-Verlag.
4. J.-M. Couvreur. Un point de vue symbolique sur la logique temporelle linéaire. In P. Leroux, Ed., Actes du Colloque LaCIM 2000, vol. 27 of Publications du LaCIM, pp. 131-140, Montréal, August 2000. Université du Québec à Montréal.
5. K. Etessami and G. J. Holzmann. Optimizing Büchi automata. In C. Palamidessi, Ed., Proc. of the 11th Int. Conf. on Concurrency Theory (CONCUR'2000), vol. 1877 of LNCS, pp. 153-167, Pennsylvania, USA, 2000. Springer-Verlag.
6. K. Etessami, R. Schuller, and T. Wilke. Fair simulation relations, parity games, and state space reduction for Büchi automata. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, Eds., Proc. of the 28th international collquium on Automata, Languages and Programming, vol. 2076 of LNCS, pp. 694-707, Crete, Greece, July 2001. Springer-Verlag.
7. C. Fritz. Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata. In O. H. Ibarra and Z. Dang, Eds., Proc. of the 8th Int. Conf. on Implementation and Application of Automata (CIAA'03), vol. 2759 of LNCS, pp. 35-48, Santa Barbara, California, July 2003. Springer-Verlag.
8. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In G. Berry, H. Comon, and A. Finkel, Eds., Proc. of the 13th Int. Conf. on Computer Aided Verification (CAV'01), vol. 2102 of LNCS, pp. 53-65, Paris, France, 2001. Springer-Verlag.
9. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. of the 15th Workshop on Protocol Specification Testing and Verification (PSTV'95), pp. 3-18, Warsaw, Poland, 1996, Chapman & Hall.
10. D. Giannakopoulou and F. Lerda. From states to transitions: Improving translation of LTL formulae to Büchi automata. In D. Peled and M. Vardi, Eds., Proc. of the 22nd Int. Conf. on Formal Techniques for Networked and Distributed Systems (FORTE'02), vol. 2529 of LNCS, pp. 308-326, Houston, Texas, November 2002. Springer-Verlag.
11. P. Godefroid and G. J. Holzmann. On the verification of temporal properties. In A. A. S. Danthine, G. Leduc, and P. Wolper, Eds., Proc. of the 13th Int. Symp. on Protocol Specification, Testing, and Verification (PSTV'93), vol. C-16 of IFIP Transactions, pp. 109-124, Liege, Belgium, May 1993. North-Holland.
12. S. Haddad, J.-M. Ilié, and K. Klai. Design and evaluation of a symbolic and abstraction-based model checker. In Proc. of the 2nd Int. Symp. on Automated Technology for Verification and Analysis (ATVA'04), Taiwan, October 2004. In press.
13. G. J. Holzmann, D. A. Peled, and M. Yannakakis. On nested depth first search. In J.-C. Grégoire, G. J. Holzmann, and D. A. Peled, Eds., Proc. of the 2nd Spin Workshop, vol. 32 of DIMACS. AMS, May 1996.
14. J. Hugues, L. Pautet, and F. Kordon. Refining middleware functions for verification purpose. In Proc. of the Monterey Workshop on Software Engineering for Embedded Systems: From Requirements to Implementation, Chicago, Illinois, September 2003.
15. M. Michel. Algèbre de machines et logique temporelle. In M. Fontet and K. Mehlhorn, Eds., Proc. of the Symp. on Theoretical Aspects of Computer Science (STACS'84), vol. 166 of LNCS, pp. 287-298, Paris, France, April 1984.
16. M. Rönkkö. LBT: LTL to Büchi conversion. http://www.tes.hut.fi/software/maria/tools/lbt/, 1999. Implements [9].
17. R. Sebastiani and S. Tonetta. "more deterministic" vs. "smaller" Büchi automata for efficient LTL model checking. In G. Goos, J. Hartmanis, and J. van Leeuwen, Eds., Proc. of the 12th Advanced Research Working Conf. on Correct Hardware Design and Verification Methods (CHARME'03), vol. 2860 of LNCS, pp. 126-140, L'Aquila, Italy, October 2003, Springer-Verlag.
18. F. Somenzi and R. Bloem. Efficient Büchi automata for LTL formulae. In Proc. of the 12th Int. Conf. on Computer Aided Verification (CAV'00), vol. 1855 of LNCS, pp. 247-263, Chicago, Illinois, USA, 2000. Springer-Verlag.
19. H. Tauriainen. A randomized testbench for algorithms translating linear temporal logic formulae into Büchi automata. In H.-D. Burkhard, L. Czaja, H.-S. Nguyen, and P. Starke, Eds., Proc. of the Concurrency, Specification and Programming 1999 Workshop (CS&P'99), pp. 251-262, Warsaw, Poland, September 1999.
20. H. Tauriainen. On translating linear temporal logic into alternating and nondeterministic automata. Research Report A83, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003.
21. Y. Thierry-Mieg, C. Dutheillet, and I. Mounier. Automatic symmetry detection in well-formed nets. In W. van der Aalst and E. Best, Eds., Proc. of the 24th Int. Conf. on Application and Theory of Petri Nets (ICATPN'03), vol. 2679 of LNCS, pp. 82-101, Eindhoven, The Netherlands, June 2003. Springer-Verlag.
22. Y. Thierry-Mieg, J.-M. Ilié, and D. Poitrenaud. A symbolic symbolic state space representation. In Proc. of the 24th Int. Conf. on Formal Techniques for Networked and Distributed Systems (FORTE'04), Madrid, Spain, September 2004. In press.
23. X. Thirioux. Simple and efficient translation from LTL formulas to Büchi automata. In R. Cleaveland and H. Garavel, Eds., Proc. of the 7th Int. ERCIM Workshop in Formal Methods for Industrial Critical Systems (FMICS'02), vol. 66(2) of ENTCS, Malaga, Spain, July 2002. Elsevier.
24. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. M. Birtwistle, Eds., Proc. of the 8th Banff Higher Order Workshop, vol. 1043 of LNCS, pp. 238-266, Banff, Alberta, Canada, 1996. Springer-Verlag.
25. P. Wolper. The tableau method for temporal logic: An overview. Logique et Analyse, (110-111):119-136, 1985.