Synchronized Tree Languages Revisited and New Applications

Authors:
Valérie Gouranton;Pierre Réty;Helmut Seidl
Affiliations:
-;-;-
Venue:
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Year:
2001

Citing 8
Cited 4

The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Process algebra

Process algebra
Haskell overloading is DEXPTIME-complete

Information Processing Letters
The regular viewpoint on PA-processes

Theoretical Computer Science
On Partial Validation of Logic Programs

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Decidable First-Order Transition Logics for PA-Processes

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
E-Unification by Means of Tree Tuple Synchronized Grammars

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Solving Disequations Modulo Some Class of Rewrite Systems

RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications

Weakly Regular Relations and Applications

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Regular Sets of Descendants by Some Rewrite Strategies

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
TTSLI: An Implementation of Tree-Tuple Synchronized Languages

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Visibly Pushdown Languages and Term Rewriting

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems

Quantified Score

Hi-index	0.01

Visualization

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 L1 (synchronized), L2 (regular), Rel(L1) ⊆ L2 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.