On termination for faulty channel machines

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 121-132

  Bouyer, Patricia ^a   Markey, Nicolas ^a   Ouaknine, Joël ^b   Schnoebelen, Philippe ^a   Worrell, James ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Automated verification; Computational complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTERS;

AUTOMATED VERIFICATION; CHANNEL MACHINES; FIFO CHANNELS; INSERTION ERRORS; METRIC TEMPORAL LOGIC; TERMINATION PROBLEMS;

COMPUTER SCIENCE;

EID: 45749087322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. In Proc. 8th Annual Symposium on Logic in Computer Science (LICS'93), pages 160-170. IEEE Computer Society Press, 1993.
2. Parosh Aziz Abdulla and Bengt Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71-90, 1996.
3. Daniel Brand and Pitro Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323-342, 1983.
4. Gérard Cécé, Alain Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20-31, 1996.
5. Pierre Chambart and Philippe Schnoebelen. Post embedding problem is not primitive recursive, with applications to channel systems. In Proc. 27th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), volume 4855 of Lecture Notes in Computer Science, pages 265-276. Springer, 2007.
6. Alain Finkel. Decidability of the termination problem for completely specificied protocols. Distributed Computing, 7(3):129-135, 1994.
7. Alain Finkel and Philippe Schnoebelen. Well structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
8. Graham Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 2:326-336, 1952.
9. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
10. Ranko Lazić. Safely freezing LTL. In Proc. 26th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, pages 381-392. Springer, 2006.
11. Ranko Lazić, Thomas C. Newcomb, Joël Ouaknine, A. W. Roscoe, and James Worrell. Nets with tokens which carry data. In Proc. 28th International Conference on Application and Theory of Petri Nets (ICATPN'07), volume 4546 of Lecture Notes in Computer Science, pages 301-320. Springer, 2007.
12. Richard Mayr. Undecidable problems in unreliable computations. Theoretical Computer Science, 297(1):35-65, 2003.
13. Joël Ouaknine and James Worrell. On the decidability of Metric Temporal Logic. In Proc. 19th Annual Symposium on Logic in Computer Science (LICS'05), pages 188-197. IEEE Computer Society Press, 2005.
14. Joël Ouaknine and James Worrell. On metric temporal logic and faulty Turing machines. In Proc. 9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'06), volume 3921 of Lecture Notes in Computer Science, pages 217-230. Springer, 2006.
15. Joël Ouaknine and James Worrell. Safety metric temporal logic is fully decidable. In Proc. 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), volume 3920 of Lecture Notes in Computer Science, pages 411-425. Springer, 2006.
16. Philippe Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters, 83(5):251-261, 2002.
17. Larry J. Stockmeyer and Albert R. Meyer. Word problems requiring exponential time: Preliminary report. In Proc. 5th AMS Symposium on Theory of Computing, 1973.