On termination and invariance for faulty channel machines

Formal Aspects of Computing

Volumn 24, Issue 4-6, 2012, Pages 595-607

  Bouyer, Patricia ^a   Markey, Nicolas ^a   Ouaknine, Jöel ^b   Schnoebelen, Philippe ^a   Worrell, James ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Channel machines; Computational complexity; Metric temporal logic; Primitive recursive; Well structured systems

Indexed keywords

CHANNEL MACHINES; FIFO CHANNELS; LOWER BOUNDS; METRIC TEMPORAL LOGIC; PRIMITIVE RECURSIVE; SATISFIABILITY PROBLEMS;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; SOFTWARE ENGINEERING;

FORMAL LOGIC;

EID: 84865443028     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-012-0234-7     Document Type: Article

References (25)

1. Abdulla PA, Cerans K, Jonsson B, Tsay Y-K (2000) Algorithmic analysis of programs with well quasi-ordered domains. Inf Comput 160(1/2):109-127
2. Abdulla PA, Jonsson B (1993) Verifying programs with unreliable channels. In: Proceedings of LICS '93. IEEE Computer Society Press, New York, pp 160-170
3. Abdulla PA, Jonsson B (1996) Undecidable verification problems for programs with unreliable channels Inf Comput 130(1): 71-90
4. Baier C, Bertrand N, Schnoebelen P (2006) On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. In: Proceedings of LPAR 2006. Lecture Notes in Artificial Intelligence, vol 4246. Springer, Berlin, pp 347-361
5. Bouyer P, Markey N, Ouaknine J, Schnoebelen P, Worrell J (2008) On termination for faulty channel machines. In: Proceedings of STACS 2008. LIPIcs, vol 1. Schloß Dagstuhl-Leibniz-Zentrum für Informatik, pp 121-132
6. Brand D, Zafiropulo P (1983) On communicating finite-state machines. J ACM 30(2):323-342
7. Cécé G, Finkel A, Purushothaman Iyer S (1996) Unreliable channels are easier to verify than perfect channels Inf Comput 124(1):20-31
8. Chambart P, Schnoebelen P (2008) The ordinal recursive complexity oflossy channel systems In: Proceedings of LICS 2008. IEEE Computer Society, New York, pp 205-216
9. Finkel A (1994) Decidability of the termination problem for completely specificied protocols Distrib Comput 7(3):129-135
10. Finkel A, Schnoebelen P (2001) Well-structured transition systems everywhere! Theor Comput Sci 256(1-2):63-92
11. Higman G (1952) Ordering by divisibility in abstract algebras. Proc Lond Math Soc 2(7):326-336
12. Henzinger TA, Manna Z, Pnueli A (1992) What good are digital clocks? In: Proceedings of 19th international colloquium on automata, languages and programming (ICALP'92). Lecture Notes in Computer Science, vol 623. Springer, Berlin, pp 545-558
13. Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages and computation. Addison-Wesley, Boston
14. Koymans R (1990) Specifying real-time properties with metric temporal logic. Real Time Syst 2(4):255-299
15. Lazić R (2011) Safety alternating automata on data words ACM Trans Comput Log 12(2):10
16. Lazić R, Newcomb T, Ouaknine J, Roscoe AW, Worrell J (2008) Nets with tokens which carry data Fundam Inf 88(3):251-274
17. Lasota S, Walukiewicz I (2008) Alternating timed automata. ACM Trans Comput Log 9(2)
18. Mayr R (2003) Undecidable problems in unreliable computations Theor Comput Sci 297(1):35-65
19. Ouaknine J, Worrell J (2005) On the decidability of metric temporal logic. In: Proceedings of LICS 2005. IEEE Computer Society Press, New York, pp 188-197
20. Ouaknine J, Worrell J (2006) On metric temporal logic and faulty Turing machines. In: Proceedings of FoSSaCS 2006. Lecture Notes in Computer Science, vol 3921. Springer, Berlin, pp 217-230
21. Ouaknine J, Worrell J (2006) Safety metric temporal logic is fully decidable. In: Proceedings of TACAS 2006. Lecture Notes in Computer Science, vol 3920. Springer, Berlin, pp 411-425
22. RackoffC (1978) The covering and boundedness problems for vector addition systems. Theor Comput Sci 6(2):223-231
23. Schnoebelen P (2002) Verifying lossy channel systems has nonprimitive recursive complexity Inf Process Lett 83(5):251-261
24. Stockmeyer LJ, Meyer AR (1973) Word problems requiring exponential time: preliminary report. In: Proceedings of STOC '73. ACM, New York, pp 1-9
25. Schmitz S, Schnoebelen P (2011) Multiply-recursive upper bounds with Higman's lemma. In: Proceedings ofICALP 2011. Lecture Notes in Computer Science, vol 6756. Springer, Berlin, pp 441-452