Mixing Lossy and Perfect Fifo Channels
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Tree Pattern Rewriting Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Pumping and counting on the regular post embedding problem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Computing blocker sets for the regular post embedding problem
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Multiply-recursive upper bounds with Higman's Lemma
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Toward a compositional theory of leftist grammars and transformations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Graph Logics with Rational Relations and the Generalized Intersection Problem
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Unidirectional channel systems can be tested
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
The parametric ordinal-recursive complexity of post embedding problems
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
The power of well-structured systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
The power of priority channel systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Hi-index | 0.00 |
We show that reachability and termination for lossy channel systems is exactly at level F_omega^omega in the Fast-Growing Hierarchy of recursive functions, the first level that dominates all multiply-recursive functions.