Synchronized Tree Languages Revisited and New Applications
- 315 Downloads
We present a new formulation for tree-tuple synchronized languages, much simpler than the existing one. This new formulation allows us to prove stronger structural results. As a consequence, synchronized languages give rise to new applications: — to rewriting: given tree languages L 1 (synchronized), L 2 (regular), Rel(L 1) ⊆ L 2 is decidable for several rewrite-like relations Rel. — to concurrency: we prove decidability of the logic EF for a process calculus allowing some bounded form of communication. Consequently, the absence of deadlocks is decidable.
Keywordstree-tuple language rewriting concurrency
- 1.J.C.M. Baeten and W.P. Weijland. Process algebra. In Cambridge Tracts in Theoretical Computer Science, volume 18, 1990.Google Scholar
- 3.V. Gouranton, P. Réty, and H. Seidl. Synchronized Tree Languages Revisited and New Applications. Research Report 2000-16, LIFO, 2000. http://www.univ-orleans.fr/SCIENCES/LIFO/Members/rety/publications.html.
- 4.S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. In Proceedings of 6th Colloquium on Trees in Algebra and Programming, volume 1214 of LNCS, pages 429–440. Springer-Verlag, 1997.Google Scholar
- 6.S. Limet and P. Réty. Solving Disequations modulo some Class of Rewrite Systems. In Proceedings of 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japon), volume 1379 of LNCS, pages 121–135. Springer-Verlag, 1998.Google Scholar
- 7.S. Limet and P. Réty. A New Result about the Decidability of the Existential One-step Rewriting Theory. In Proceedings of 10th Conference on Rewriting Techniques and Applications, Trento (Italy), volume 1631 of LNCS. Springer-Verlag, 1999.Google Scholar
- 8.S. Limet and F. Saubion. On partial validation of logic programs. In M. Johnson, editor, proc of the 6th Conf. on Algebraic Methodology and Software Technology, Sydney (Australia), volume 1349 of LNCS, pages 365–379. Springer Verlag, 1997.Google Scholar
- 9.D. Lugiez and P. Schnoebelen. Decidable firt-order transition logics for PA-processes. In Springer, editor, ICALP, LNCS, Geneva, Switzerland, July 2000.Google Scholar
- 10.D. Lugiez and P. Schnoebelen. The regular viewpoint on PA-processes. Theoretical Computer Science, 2000.Google Scholar
- 11.G.D. Plotkin. A structural approach of operational semantics. Technical Report FN-19, DAIMI, Aarhus University, Denmark, 1981.Google Scholar
- 12.F. Saubion and I. Stéphan. On Implementation of Tree Synchronized Languages. In Proceedings of 10th Conference on Rewriting Techniques and Applications, Trento (Italy), LNCS. Springer-Verlag, 1999.Google Scholar
- 14.F. Seynhaeve, S. Tison, and M. Tommasi. Homomorphisms and concurrent term rewriting. In G. Ciobanu and G. Paun, editors, Proceedings of the twelfth International Conference on Fundamentals of Computation theory, number 1684 in Lecture Notes in Computer Science, pages 475–487, Iasi, Romania, 1999.Google Scholar