The ω-regular post embedding problem

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

Volumn 4962 LNCS, Issue , 2008, Pages 97-111

  Chambart, P ^a   Schnoebelen, Ph ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FOUNDATIONS;

COMPUTATIONAL STRUCTURES; CORRESPONDENCE PROBLEMS; EUROPEAN; HEIDELBERG (CO); INTERNATIONAL (CO); LOSSY CHANNEL SYSTEMS (LCS); NON-TRIVIAL; REACH ABILITY; REGULAR CONSTRAINTS; SOFTWARE SCIENCE;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 47249148909     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_8     Document Type: Conference Paper

References (20)

1. Abdulla, P.A., Deneux, J., Ouaknine, J., Worrell, J.: Decidability and complexity results for timed automata via channel machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1089-1101. Springer, Heidelberg (2005)
2. Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Information and Computation 130(1), 71-90 (1996)
3. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91-101 (1996)
4. Amadio, R., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous π-calculus. Nordic Journal of Computing 9(2), 70-101 (2002)
5. Baier, C., Bertrand, N., Schnoebelen, P.: On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 347-361. Springer, Heidelberg (2006)
6. Chambart, P.: Canaux fiables et non-fiables: frontières de la décidabilité. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France (September 2007)
7. Chambart, P., Schnoebelen, P.: Post embedding problem is not primitive recursive, with applications to channel systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 265-276. Springer, Heidelberg (2007)
8. Delzanno, G.: Constraint-based automatic verification of abstract models of multithreaded programs. Theory and Practice of Logic Programming 7(1-2), 67-91 (2007)
9. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. In: Proc. LICS 2006, pp. 17-26. IEEE Comp. Soc. Press, Los Alamitos (2006)
10. Finkel, A.: Une généralisation des théorèmes de Higman et de Simon aux mots infinis. Theoretical Computer Science 38(1), 137-142 (1985)
11. Gabelaia, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Non-primitive recursive decidability of products of modal logics with expanding domains. Annals of Pure and Applied Logic 142(1-3), 245-268 (2006)
12. Jurdziński, M., Lazić, R.: Alternation-free modal mu-calculus for data trees. In: Proc. LICS 2007, pp. 131-140. IEEE Comp. Soc. Press, Los Alamitos (2007)
13. Konev, B., Wolter, F., Zakharyaschev, M.: Temporal logics over transitive states. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 182-203. Springer, Heidelberg (2005)
14. Kurucz, A.: Combining modal logics. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logics, vol. 3, ch. 15, pp. 869-926. Elsevier, Amsterdam (2006)
15. Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 250-265. Springer, Heidelberg (2005)
16. Lazić, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 301-320. Springer, Heidelberg (2007)
17. Ouaknine, J., Worrell, J.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 217-230. Springer, Heidelberg (2006)
18. Ouaknine, J., Worrell, J.: On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Comp. Science 3(1), 1-27 (2007)
19. Pachl, J.K.: Protocol description and analysis based on a state transition model with channel expressions. In: Proc. PSTV 1987, pp. 207-219. North-Holland, Amsterdam (1987)
20. Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters 83(5), 251-261 (2002)