Omega-regular model checking

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

Volumn 2988, Issue , 2004, Pages 561-575

  Boigelot, Bernard ^a   Legay, Axel ^a   Wolper, Pierre ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; ITERATIVE METHODS; SPEECH RECOGNITION; TRANSDUCERS;

CENTRAL PROBLEMS; ENCODINGS; FINITE STATE TRANSDUCERS; FINITE WORDS; INFINITE STATE SYSTEMS; ITERATION TECHNIQUES; REGULAR MODEL CHECKING; THEORETICAL DEVELOPMENT;

MODEL CHECKING;

EID: 35048904099     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_41     Document Type: Article

References (24)

1. +95] R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138(1):3-34, 1995.
2. [AJMd02] P. A. Abdulla, B. Jonsson, P. Mahata, and J. d'Orso. Regular tree model checking. In Proc. 14th Int. Conf. on Computer Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, July 2002.
3. [BBR97] B. Boigelot, L. Bronne, and S. Rassart. An improved reachability analysis method for strongly linear hybrid systems. In Proceedings of the 9th International Conference on Computer-Aided Verification, number 1254 in Lecture Notes in Computer Science, pages 167-177, Haifa, Israel, June 1997. Springer-Verlag.
4. [BGWW97] Bernard Boigelot, Patrice Godefroid, Bernard Willems, and Pierre Wolper. The power of QDDs. In Proc. of Int. Static Analysis Symposium, volume 1302 of Lecture Notes in Computer Science, pages 172-186, Paris, September 1997. Springer-Verlag.
5. [BHJ03] B. Boigelot, F. Herbreteau, and S. Jodogne. Hybrid acceleration using real vector automata. In Proceedings 15th International Conference on Computer Aided Verification (CAV), volume 2725 of Lecture Notes in Computer Science, pages 193-205, Boulder, USA, 2003. Springer-Verlag.
6. [BJNT00] A. Bouajjani, B. Jonsson, M. Nilsson, and Tayssir Touili. Regular model checking. In E. A. Emerson and A. P. Sistla, editors, Proceedings of the 12th International Conference on Computer-Aided Verification (CAV'00), volume 1855 of Lecture Notes in Computer Science, pages 403-418. Springer-Verlag, 2000.
7. [BJW01] Bernard Boigelot, Sébastien Jodogne, and Pierre Wolper. On the use of weak automata for deciding linear arithmetic with integer and real variables. In Proc. International Joint Conference on Automated Reasoning (IJCAR), volume 2083 of Lecture Notes in Computer Science, pages 611-625, Siena, Italy, June 2001. Springer-Verlag.
8. [BLW03] Bernard Boigelot, Axel Legay, and Pierre Wolper. Iterating transducers in the large. In Proc. 15th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 223-235, Boulder, USA, July 2003. Springer-Verlag.
9. [Bow96] F. D. J. Bowden. Modelling time in Petri nets. In Proceedings of the second Australia-Japan Workshop on Stochastic Models in Engineering, Technology and Management, Gold Coast, Australia, July 1996.
10. [BRW98] Bernard Boigelot, Stéphane Rassart, and Pierre Wolper. On the expressiveness of real and integer arithmetic automata. In Proc. 25th Colloq. on Automata, Programming, and Languages (ICALP), volume 1443 of Lecture Notes in Computer Science, pages 152-163. Springer-Verlag, July 1998.
11. [BSW69] Bartlett, K. A., Scantlebury, R. A., and Wilkinson, P. T. A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM, 12(5):260-261, May 1969.
12. [BT02] A. Bouajjani and T. Touili. Extrapolating tree transformations. In Proc. 14th Int. Conf. on Computer Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, July 2002.
13. [DLS01] D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. In Proceedings 13th International Conference on Computer Aided Verification (CAV), volume 2102 of Lecture Notes in Computer Science, pages 286-297, Paris, France, 2001. Springer.
14. [Hop71] J. E. Hopcroft. An n log n algorithm for minimizing states in a finite automaton. Theory of Machines and Computation, pages 189-196, 1971.
15. [JN00] B. Jonsson and M. Nilson. Transitive closures of regular relations for verifying infinite-state systems. In S. Graf and M. Schwartzbach, editors, Proceeding of the 6th International conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1875 of Lecture Notes in Computer Science, pages 220-234. Springer, 2000.
16. +97] Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In Proceedings of 9th International Conference on Computer-Aided Verification (CAV'97), volume 1254 of Lecture Notes in Computer Science, pages 424-435. Springer, 1997.
17. [LASH] The Liège Automata-based Symbolic Handler (LASH). Available at http://www.monteflore.ulg.ac.be/~boigelot/research/lash/.
18. [Leg03] A. Legay. Iterating transducers: from experiments to concepts and algorithms. Master's thesis, University of Liège, 2003.
19. [Löd01] C. Löding. Efficient minimization of deterministic weak ω-automata. Information Processing Letters, 79(3):105-109, 2001.
20. [MSS86] . D. E. Muller, A. Saoudi, and P. E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th Int. Colloquium on Automata, Languages and Programming, pages 275-283, Rennes, 1986. Springer-Verlag.
21. [Saf92] S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In Proceedings of the 24th ACM Symposium on Theory of Computing, Victoria, May 1992.
22. [Tou01] T. Touili. Regular model checking using widening techniques. In Proceeding of Workshop on Verification of Parametrized Systems (VEPAS'01), volume 50 of Electronic Notes in Theoretical Computer Science, 2001.
23. [WB95] Pierre Wolper and Bernard Boigelot. An automata-theoretic approach to Presburger arithmetic constraints. In Proc. Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 21-32, Glasgow, September 1995. Springer-Verlag.
24. [WB98] Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 88-97, Vancouver, July 1998. Springer-Verlag.