We introduce Priority Channel Systems, a new natural class of channel systems where messages carry a numeric priority and where higher-priority messages can supersede lower-priority messages preceding them in the fifo communication buffers. The decidability of safety and inevitability properties is shown via the introduction of a priority embedding, a well-quasi-ordering that has not previously been used in well-structured systems. We then show how Priority Channel Systems can compute Fast-Growing functions and prove that the aforementioned verification problems are Fε0-complete. © 2013 Springer-Verlag.
CITATION STYLE
Haase, C., Schmitz, S., & Schnoebelen, P. (2013). The power of priority channel systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8052 LNCS, pp. 319–333). https://doi.org/10.1007/978-3-642-40184-8_23
Mendeley helps you to discover research relevant for your work.