The ordinal recursive complexity of lossy channel systems

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 205-216

  Chambart, P ^a   Schnoebelen, Ph ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTERS;

LOGIC IN COMPUTER SCIENCE; LOSSY CHANNEL SYSTEMS; REACH ABILITY;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 51549107969     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.47     Document Type: Conference Paper

References (28)

1. P. A. Abdulla, N. Bertrand, A. Rabinovich, and Ph. Schnoebelen. Verification of probabilistic systems with faulty communication. Information and Computation, 202(2):141-165, 2005.
2. P. A. Abdulla, A. Bouajjani, and J. d'Orso. Monotonic and downward closed games. Journal of Logic and Computation, 18(1):153-169, 2008.
3. P. A. Abdulla, J. Deneux, J. Ouaknine, and J. Worrell. Decidability and complexity results for timed automata via channel machines. In Proc. ICALP 2005, volume 3580 of Lecture Notes in Computer Science, pages 1089-1101. Springer, 2005.
4. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
5. C. Baier, N. Bertrand, and Ph. Schnoebelen. On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. In Proc. LPAR 2006, volume 4246 of Lecture Notes in Artificial Intelligence, pages 347-361. Springer, 2006.
6. C. Baier, N. Bertrand, and Ph. Schnoebelen. Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Transactions on Computational Logic, 9(1), 2007.
7. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323-342, 1983.
8. G. Cécé, A. Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20-31, 1996.
9. P. Chambart and Ph. Schnoebelen. Post embedding problem is not primitive recursive, with applications to channel systems. In Proc. FST & TCS 2007, volume 4855 of Lecture Notes in Computer Science, pages 265-276. Springer, 2007.
10. P. Chambart and Ph. Schnoebelen. The ω-regular Post embedding problem. In Proc. FOSSACS 2008, volume 4962 of Lecture Notes in Computer Science, pages 97-111. Springer, 2008.
11. E. A. Cichon. Personal communication, Dec. 2007.
12. E. A. Cichon and E. Tahhan Bittar. Ordinal recursive bounds for Higman's theorem. Theoretical Computer Science, 201(1-2):63-84, 1998.
13. D. H. J. de Jongh and R. Parikh. Well-partial orderings and hierarchies. Indag. Math., 39(3):195-207, 1977.
14. S. Demri and R. Lazić. LTL with the freeze quantifier and register automata. In Proc. LICS 2006, pages 17-26. IEEE Comp. Soc. Press, 2006.
15. M. V. Fairtlough and S. S. Wainer. Hierarchies of provably recursive functions. In S. Buss, editor, Handbook of Proof Theory, volume 137 of Studies in Logic, chapter 3, pages 149-207. North-Holland, 1998.
16. A. Finkel. Decidability of the termination problem for completely specificied protocols. Distributed Computing, 7(3):129-135, 1994.
17. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
18. D. Gabelaia, A. Kurucz, F. Wolter, and M. Zakharyaschev. Non-primitive recursive decidability of products of modal logics with expanding domains. Annals of Pure and Applied Logic, 142(1-3):245-268, 2006.
19. B. Konev, F. Wolter, and M. Zakharyaschev. Temporal logics over transitive states. In Proc. CADE 2005, volume 3632 of Lecture Notes in Computer Science, pages 182-203. Springer, 2005.
20. A. Kučera and Ph. Schnoebelen. A general approach to comparing infinite-state systems with their finite-state specifications. Theoretical Computer Science, 358(2-3):315-333, 2006.
21. S. Lasota and I. Walukiewicz. Alternating timed automata. In Proc. FOSSACS 2005, volume 3441 of Lecture Notes in Computer Science, pages 250-265. Springer, 2005.
22. R. Lazić, T. Newcomb, J. Ouaknine, A. W. Roscoe, and J. Worrell. Nets with tokens which carry data. In Proc. ICATPN 2007, volume 4546 of Lecture Notes in Computer Science, pages 301-320. Springer, 2007.
23. R. Mayr. Undecidable problems in unreliable computations. Theoretical Computer Science, 297(1-3):337-354, 2003.
24. K. McAloon. Petri nets and large finite sets. Theoretical Comput. Sci., 32(1-2):173-183, 1984.
25. H. E. Rose. Subrecursion: Functions and Hierarchies, volume 9 of Oxford Logic Guides. Oxford Univ. Press, 1984.
26. Ph. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters, 83(5):251-261,2002.
27. H. Touzet. Propriétés combinatoires pour la terminaison de systèmes des réécriture. Thèse de doctorat, Université de Nancy 1, France, Sept. 1997.
28. S. S. Wainer. A classification of the ordinal recursive functions. Arvh. math. Logik Grundlag., 13(3-4):136-153, 1970.