Abstract
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.
Chapter PDF
Similar content being viewed by others
References
J.C.M. Baeten and W.P. Weijland. Process algebra. In Cambridge Tracts in Theoretical Computer Science, volume 18, 1990.
B. Courcelle. The Monadic Second-Order Logic of Graphs I, Recognizable Sets of Finite Graphs. In Inf. Comp., volume 85, pages 12–75, 1990.
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.
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.
S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. Discrete Mathematics and Theoritical Computer Science (http://dmtcs.loria.fr/), 1:69–98, 1997.
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.
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.
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.
D. Lugiez and P. Schnoebelen. Decidable firt-order transition logics for PA-processes. In Springer, editor, ICALP, LNCS, Geneva, Switzerland, July 2000.
D. Lugiez and P. Schnoebelen. The regular viewpoint on PA-processes. Theoretical Computer Science, 2000.
G.D. Plotkin. A structural approach of operational semantics. Technical Report FN-19, DAIMI, Aarhus University, Denmark, 1981.
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.
H. Seidl. Haskell Overloading is DEXPTIME Complete. Information Processing Letters, 52(2):57–60, 1994.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gouranton, V., Réty, P., Seidl, H. (2001). Synchronized Tree Languages Revisited and New Applications. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive