Safety alternating automata on data words

ACM Transactions on Computational Logic

Volumn 12, Issue 2, 2011, Pages

  Lazić, Ranko ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING AUTOMATA; COMPLEXITY BOUNDS; FINITE ALPHABET; LINEAR TEMPORAL LOGIC; SATISFIABILITY; TEMPORAL OPERATORS; UNDECIDABILITY;

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY;

TEMPORAL LOGIC;

EID: 79551680264     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1877714.1877716     Document Type: Article

References (20)

1. ALPERN, B. AND SCHNEIDER, F. B. 1987. Recognizing Safety And Liveness. Distr. Comput. 2, 3, 117-126.
2. BJÖRKLUND, H. AND SCHWENTICK, T. 2007. On notions of regularity for data languages. In Proceedings of the 16th Annual Symposium on the Fundamentals of Computational Theory (FCT). Lecture Notes in Computer Science, vol. 4639, Springer, 88-99.
3. BOJAŃCZYK, M., DAVID, C., MUSCHOLL, A., SCHWENTICK, T., AND SEGOUFIN, L. 2006a. Two-variable logic on data trees and XML reasoning. In Proceedings of the 25th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). ACM, 10-19. (Pubitemid 46946462)
4. BOJAŃCZYK, M., MUSCHOLL, A., SCHWENTICK, T., SEGOUFIN, L., AND DAVID, C. 2006b. Two-variable logic on words with data. In Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society, 7-16.
5. BOUYER, P., MARKEY, N., OUAKNINE, J., SCHNOEBELEN, P., AND WORRELL, J. 2008. On termination for faulty channel machines. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS). IBFI, Schloss Dagstuhl, Germany, 121-132.
6. BRZOZOWSKI, J. A. AND LEISS, E. L. 1980. On equations for regular languages, finite automata, and sequential networks. Theor. Comput. Sci. 10, 1, 19-35.
7. DAVID, C. 2004. Mots et données infinies. M. S. thesis, Laboratoire d'Informatique Algorithmique, Fondements et Applications, Paris.
8. DEMRI, S. AND LAZIĆ, R. 2009. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Logic 10, 3.
9. DICKSON, L. 1913. Finiteness of the odd perfect and primitive abundant numbers with distinct factors. Amer. J. Math. 35, 413-422.
10. JURDZIŃSKI, M. AND LAZIĆ, R. 2007. Alternation-free modal mu-calculus for data trees. In Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society, 131-140.
11. KAMINSKI, M. AND FRANCEZ, N. 1994. Finite-memory automata. Theor. Comput. Sci. 134, 2, 329-363.
12. LAZIĆ, R. 2006. Safely freezing LTL. In Proceedings of the 26th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS). Lecture Notes in Computer Science, vol. 4337, Springer, 381-392.
13. LIPTON, R. J. 1976. The reachability problem requires exponential space. Tech. rep. 62, Yale University.
14. LÖDING, C. AND THOMAS, W. 2000. Alternating automata and logics over infinite words. In Proceedings of the International Conference on Theoretical Computer Science (IFIP TCS). Lecture Notes in Computer Science, vol. 1878, Springer, 521-535.
15. MULLER, D. E., SAOUDI, A., AND SCHUPP, P. E. 1986. Alternating automata, the weak monadic theory of the tree, and its complexity. In Proceedings of the 13th International Conference on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 226, Springer, 275-283.
16. NEVEN, F., SCHWENTICK, T., AND VIANU, V. 2004. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5, 3, 403-435.
17. OUAKNINE, J. AND WORRELL, J. 2006. Safety metric temporal logic is fully decidable. In Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol. 3920, Springer, 411-425. (Pubitemid 44019385)
18. SAKAMOTO, H. AND IKEDA, D. 2000. Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231, 2, 297-308.
19. SEGOUFIN, L. 2006. Automata and logics for words and trees over an infinite alphabet. In Proceedings of the 20th International Conference on Computer Science Logic (CSL). Lecture Notes in Computer Science, vol. 4207, Springer, 41-57.
20. VARDI, M. Y. 1996. An automata-theoretic approach to linear temporal logic. In Banff Higher Order Works. Lecture Notes in Computer Science, vol. 1043, Springer, 238-266.