Theoretical Computer Science
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Decidability of the termination problem for completely specified protocols
Distributed Computing
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Simulating perfect channels with probabilistic lossy channels
Information and Computation
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Temporal logics over transitive states
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Mixing Lossy and Perfect Fifo Channels
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
The ω-regular post embedding problem
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
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
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
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
Proceedings of the 32nd symposium on Principles of database systems
Rational subsets and submonoids of wreath products
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
The power of well-structured systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.01 |
We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg, a further variant where solutions are constrained and must belong to a given regular language. PEPreg is decidable but not primitive recursive. This entails the decidability of reachability for unidirectional systems with one reliable and one lossy channel.