Undecidable verification problems for programs with unreliable channels
Information and Computation
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
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Constraint-based automatic verification of abstract models of multithreaded programs
Theory and Practice of Logic Programming
Alternation-free modal mu-calculus for data trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Nets with tokens which carry data
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Post embedding problem is not primitive recursive, with applications to channel systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
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
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
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
Unidirectional channel systems can be tested
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
Post's Embedding Problem is a new variant of Post's Correspondence Problem where words are compared with embedding rather than equality. It has been shown recently that adding regular constraints on the form of admissible solutions makes the problem highly non-trivial, and relevant to the study of lossy channel systems. Here we consider the infinitary version and its application to recurrent reachability in lossy channel systems.