The power of priority channel systems

Logical Methods in Computer Science

Volumn 10, Issue 4, 2014, Pages

  Haase, Christoph ^a   Schmitz, Sylvain ^a   Schnoebelen, Philippe ^a  

^a CNRS   (France)

Author keywords

Fast growing complexity; Well quasi order; Well structured transition systems

Indexed keywords

CHANNEL SYSTEMS; COMMUNICATION BUFFER; FAST-GROWING COMPLEXITY; STRUCTURED SYSTEMS; VERIFICATION PROBLEMS; WELL QUASI ORDERINGS; WELL-STRUCTURED TRANSITION SYSTEMS;

COMPUTABILITY AND DECIDABILITY;

EID: 84916896927     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-10(4:4)2014     Document Type: Article

References (44)

1. P. A. Abdulla, M. F. Atig, and J. Cederberg. Timed lossy channel systems. In FST&TCS 2012, volume 18 of Leibniz International Proceedings in Informatics, pages 374-386. Leibniz-Zentrum für Informatik, 2012.
2. P. A. Abdulla, K. Čeráns, B. Jonsson, and Yih-Kuen Tsay. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160(1-2):109-127, 2000.
3. P. A. Abdulla, J. Deneux, J. Ouaknine, and J. Worrell. Decidability and complexity results for timed automata via channel machines. In ICALP 2005, volume 3580 of Lecture Notes in Computer Science, pages 1089-1101. Springer, 2005.
4. A. V. Aho. Nested stack automata. Journal of the ACM, 16(3):383-406, 1969.
5. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
6. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for diérentiated services. RFC 2475, December 1998.
7. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. Formal Methods in System Design, 14(3):237-255, 1999.
8. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theoretical Computer Science, 221(1-2):211-250, 1999.
9. R. V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. Theoretical Computer Science, 19:231-251, 1982.
10. K. Bansal, E. Koskinen, T. Wies, and D. Zuérey. Structural counter abstraction. In TACAS 2013, volume 7795 of Lecture Notes in Computer Science, pages 62-77. Springer, 2013.
11. P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen, and J. Worrell. On termination and invariance for faulty channel machines. Formal Aspects of Computing, 24(4-6):595-607, 2012.
12. R. Bonnet. Theory of Well-Structured Transition Systems and Extended Vector-Addition Systems. Thése de doctorat, ENS Cachan, France, 2013.
13. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323-342, 1983.
14. G. Cécé and A. Finkel. Verification of programs with half-duplex communication. Information and Computation, 202(2):166-190, 2005.
15. 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.
16. P. Chambart and Ph. Schnoebelen. The ordinal recursive complexity of lossy channel systems. In LICS 2008, pages 205-216. IEEE Press, 2008.
17. D. H. J. de Jongh and R. Parikh. Well-partial orderings and hierarchies. Indagationes Mathemat- icae, 39(3):195-207, 1977.
18. G. Delzanno, A. Sangnier, and G. Zavattaro. Parameterized verification of ad hoc networks. In Concur 2010, volume 6269 of Lecture Notes in Computer Science, pages 313-327. Springer, 2010.
19. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
20. M. Fairtlough and S. S. Wainer. Hierarchies of provably recursive functions. In S. Buss, editor, Handbook of Proof Theory, chapter III, pages 149-207. Elsevier, 1998.
21. B. Genest, A. Muscholl, O. Serre, and M. Zeitoun. Tree pattern rewriting systems. In ATVA 2008, volume 5311 of Lecture Notes in Computer Science, pages 332-346. Springer, 2008.
22. A. Gupta. A constructive proof that trees are well-quasi-ordered under minors. In LFCS 1992, volume 620 of Lecture Notes in Computer Science, pages 174-185. Springer, 1992.
23. S. Haddad, S. Schmitz, and Ph. Schnoebelen. The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. In LICS 2012, pages 355-364. IEEE Press, 2012.
24. C. Haase, S. Schmitz, and Ph. Schnoebelen. The power of priority channel systems. In Concur 2013, volume 8052 of Lecture Notes in Computer Science, pages 319-333. Springer, 2013.
25. B. König and J. Stückrath. A general framework for well-structured graph transformation systems. In Concur 2014, volume 8704 of Lecture Notes in Computer Science, pages 467-481. Springer, 2014.
26. A. Kurucz. Combining modal logics. In Handbook of Modal Logics, chapter 15, pages 869-926. Elsevier, 2006.
27. J.-Y. Le Boudec. The Asynchronous Transfer Mode: a tutorial. Computer Networks and ISDN Systems, 24(4):279-309, 1992.
28. M.H. Löb and S.S. Wainer. Hierarchies of number theoretic functions, I. Archiv für Mathematische Logik und Grundlagenforschung, 13:39-51, 1970.
29. S. Lasota and I. Walukiewicz. Alternating timed automata. ACM Transactions on Computational Logic, 9(2), 2008.
30. R. Mayr. Undecidable problems in unreliable computations. Theoretical Computer Science, 297(1-3):337-354, 2003.
31. R. Meyer. On boundedness in depth in the π-calculus. In IFIP TCS 2008, volume 273 of IFIP, pages 477-489. Springer, 2008.
32. A. Muscholl. Analysis of communicating automata. In LATA 2010, volume 6031 of Lecture Notes in Computer Science, pages 50-57. Springer, 2010.
33. P. Ossona de Mendez and J. Nešetřil. Sparsity, chapter 6: Bounded height trees and tree-depth, pages 115-144. Springer, 2012.
34. J. Ouaknine and J. Worrell. On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Computer Science, 3(1):1-27, 2007.
35. J. K. Pachl. Protocol description and analysis based on a state transition model with channel expressions. In PSTV '87, pages 207-219. North-Holland, 1987.
36. K. Reinhardt. Reachability in Petri nets with inhibitor arcs. In RP 2008, volume 223 of Electronic Notes in Theoretical Computer Science, pages 239-264. Elsevier, 2008.
37. M. Rathjen and A. Weiermann. Proof-theoretic investigations on Kruskal's Theorem. Annals of Pure and Applied Logic, 60(1):49-88, 1993.
38. Ph. Schnoebelen. Lossy counter machines decidability cheat sheet. In RP 2010, volume 6227 of Lecture Notes in Computer Science, pages 51-75. Springer, 2010.
39. Ph. Schnoebelen. Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In MFCS 2010, volume 6281 of Lecture Notes in Computer Science, pages 616-628. Springer, 2010.
40. S. Schmitz. Complexity hierarchies beyond Elementary. Preprint, December 2013. arXiv:1312.5686 [cs.CC].
41. K. Schütte and S. G. Simpson. Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen. Archiv für Mathematische Logik und Grundlagenforschung, 25(1):75-89, 1985.
42. S. Schmitz and Ph. Schnoebelen. Multiply-recursive upper bounds with Higman's Lemma. In ICALP 2011, volume 6756 of Lecture Notes in Computer Science, pages 441-452. Springer, 2011.
43. S. Schmitz and Ph. Schnoebelen. Algorithmic aspects of WQO theory. Lecture notes, 2012. cel.archives-ouvertes.fr:cel-00727025.
44. S. Schmitz and Ph. Schnoebelen. The power of well-structured systems. In Concur 2013, volume 8052 of Lecture Notes in Computer Science, pages 5-24. Springer, 2013. Invited talk.