@inproceedings{bf33da09082c4c73b90a4d1abf88de62,
title = "Synchronized tree languages revisited and new applications",
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.",
keywords = "Concurrency, Rewriting, Tree-tuple language",
author = "Val{\'e}rie Gouranton and Pierre R{\'e}ty and Helmut Seidl",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 4th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 ; Conference date: 02-04-2001 Through 06-04-2001",
year = "2001",
doi = "10.1007/3-540-45315-6_14",
language = "English",
isbn = "3540418644",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "214--229",
editor = "Furio Honsell and Marino Miculan",
booktitle = "Foundations of Software Science and Computation Structures - 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001, Proceedings",
}