Synchronized Tree Languages Revisited and New Applications
Identifieur interne : 001136 ( Istex/Corpus ); précédent : 001135; suivant : 001137Synchronized Tree Languages Revisited and New Applications
Auteurs : Valérie Gouranton ; Pierre Réty ; Helmut SeidlSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.
Abstract
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.
Url:
DOI: 10.1007/3-540-45315-6_14
Links to Exploration step
ISTEX:D0F06663F37BD2DA6FD46040AAABE57C9E035ED8Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Synchronized Tree Languages Revisited and New Applications</title>
<author><name sortKey="Gouranton, Valerie" sort="Gouranton, Valerie" uniqKey="Gouranton V" first="Valérie" last="Gouranton">Valérie Gouranton</name>
<affiliation><mods:affiliation>LIFO, Université d’Orléans, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: emgouranto@lifo.univ-orleans.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Rety, Pierre" sort="Rety, Pierre" uniqKey="Rety P" first="Pierre" last="Réty">Pierre Réty</name>
<affiliation><mods:affiliation>LIFO, Université d’Orléans, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: rety@lifo.univ-orleans.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation><mods:affiliation>Dept. of Computer Science, University of Trier, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:D0F06663F37BD2DA6FD46040AAABE57C9E035ED8</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1007/3-540-45315-6_14</idno>
<idno type="url">https://api.istex.fr/document/D0F06663F37BD2DA6FD46040AAABE57C9E035ED8/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001136</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001136</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Synchronized Tree Languages Revisited and New Applications</title>
<author><name sortKey="Gouranton, Valerie" sort="Gouranton, Valerie" uniqKey="Gouranton V" first="Valérie" last="Gouranton">Valérie Gouranton</name>
<affiliation><mods:affiliation>LIFO, Université d’Orléans, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: emgouranto@lifo.univ-orleans.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Rety, Pierre" sort="Rety, Pierre" uniqKey="Rety P" first="Pierre" last="Réty">Pierre Réty</name>
<affiliation><mods:affiliation>LIFO, Université d’Orléans, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: rety@lifo.univ-orleans.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation><mods:affiliation>Dept. of Computer Science, University of Trier, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2001</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">D0F06663F37BD2DA6FD46040AAABE57C9E035ED8</idno>
<idno type="DOI">10.1007/3-540-45315-6_14</idno>
<idno type="ChapterID">14</idno>
<idno type="ChapterID">Chap14</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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.</div>
</front>
</TEI>
<istex><corpusName>springer</corpusName>
<author><json:item><name>Valérie Gouranton</name>
<affiliations><json:string>LIFO, Université d’Orléans, France</json:string>
<json:string>E-mail: emgouranto@lifo.univ-orleans.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Pierre Réty</name>
<affiliations><json:string>LIFO, Université d’Orléans, France</json:string>
<json:string>E-mail: rety@lifo.univ-orleans.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Helmut Seidl</name>
<affiliations><json:string>Dept. of Computer Science, University of Trier, Germany</json:string>
<json:string>E-mail: seidl@psi.uni-trier.de</json:string>
</affiliations>
</json:item>
</author>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>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.</abstract>
<qualityIndicators><score>6.044</score>
<pdfVersion>1.3</pdfVersion>
<pdfPageSize>430 x 650 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<keywordCount>0</keywordCount>
<abstractCharCount>571</abstractCharCount>
<pdfWordCount>6519</pdfWordCount>
<pdfCharCount>29208</pdfCharCount>
<pdfPageCount>16</pdfPageCount>
<abstractWordCount>87</abstractWordCount>
</qualityIndicators>
<title>Synchronized Tree Languages Revisited and New Applications</title>
<chapterId><json:string>14</json:string>
<json:string>Chap14</json:string>
</chapterId>
<refBibs><json:item><author><json:item><name>J,C M Baeten</name>
</json:item>
<json:item><name>W,P Weijland</name>
</json:item>
</author>
<host><volume>18</volume>
<author></author>
<title>In Cambridge Tracts in Theoretical Computer Science</title>
<publicationDate>1990</publicationDate>
</host>
<title>Process algebra</title>
<publicationDate>1990</publicationDate>
</json:item>
<json:item><host><pages><last>75</last>
<first>12</first>
</pages>
<author><json:item><name>B Courcelle</name>
</json:item>
</author>
<title>The Monadic Second-Order Logic of Graphs I, Recognizable Sets of Finite Graphs</title>
<publicationDate>1990</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>V Gouranton</name>
</json:item>
<json:item><name>P Réty</name>
</json:item>
<json:item><name>H Seidl</name>
</json:item>
</author>
<host><author></author>
<title>Research Report</title>
<publicationDate>2000</publicationDate>
</host>
<title>Synchronized Tree Languages Revisited and New Applications</title>
<publicationDate>2000</publicationDate>
</json:item>
<json:item><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>P Réty</name>
</json:item>
</author>
<host><pages><last>440</last>
<first>429</first>
</pages>
<author></author>
<title>Proceedings of 6th Colloquium on Trees in Algebra and Programming</title>
<publicationDate>1997</publicationDate>
</host>
<title>E-Unification by Means of Tree Tuple Synchronized Grammars</title>
<publicationDate>1997</publicationDate>
</json:item>
<json:item><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>P Réty</name>
</json:item>
</author>
<host><volume>1</volume>
<pages><last>98</last>
<first>69</first>
</pages>
<author></author>
<title>Discrete Mathematics and Theoritical Computer Science</title>
<publicationDate>1997</publicationDate>
</host>
<title>E-Unification by Means of Tree Tuple Synchronized Grammars</title>
<publicationDate>1997</publicationDate>
</json:item>
<json:item><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>P Réty</name>
</json:item>
</author>
<host><pages><last>135</last>
<first>121</first>
</pages>
<author></author>
<title>Proceedings of 9th Conference on Rewriting Techniques and Applications</title>
<publicationDate>1998</publicationDate>
</host>
<title>Solving Disequations modulo some Class of Rewrite Systems</title>
<publicationDate>1998</publicationDate>
</json:item>
<json:item><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>P Réty</name>
</json:item>
</author>
<host><author></author>
<title>A New Result about the Decidability of the Existential Onestep Rewriting Theory Proceedings of 10th Conference on Rewriting Techniques and Applications volume 1631 of LNCS</title>
<publicationDate>1999</publicationDate>
</host>
<publicationDate>1999</publicationDate>
</json:item>
<json:item><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>F Saubion</name>
</json:item>
</author>
<host><pages><last>379</last>
<first>365</first>
</pages>
<author></author>
<title>proc of the 6th Conf. on Algebraic Methodology and Software Technology</title>
<publicationDate>1997</publicationDate>
</host>
<title>On partial validation of logic programs</title>
<publicationDate>1997</publicationDate>
</json:item>
<json:item><host><author><json:item><name>D Lugiez</name>
</json:item>
<json:item><name>P Schnoebelen</name>
</json:item>
</author>
<title>Decidable firt-order transition logics for PAprocesses</title>
<publicationDate>2000-07</publicationDate>
</host>
</json:item>
<json:item><host><author><json:item><name>D Lugiez</name>
</json:item>
<json:item><name>P Schnoebelen</name>
</json:item>
</author>
<title>The regular viewpoint on PA-processes</title>
<publicationDate>2000</publicationDate>
</host>
</json:item>
<json:item><host><author><json:item><name>G,D Plotkin</name>
</json:item>
</author>
<title>A structural approach of operational semantics</title>
<publicationDate>1981</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>F Saubion</name>
</json:item>
<json:item><name>I Stéphan</name>
</json:item>
</author>
<host><author></author>
<title>Proceedings of 10th Conference on Rewriting Techniques and Applications</title>
<publicationDate>1999</publicationDate>
</host>
<title>On Implementation of Tree Synchronized Languages</title>
<publicationDate>1999</publicationDate>
</json:item>
<json:item><author><json:item><name>H Seidl</name>
</json:item>
</author>
<host><volume>52</volume>
<pages><last>60</last>
<first>57</first>
</pages>
<issue>2</issue>
<author></author>
<title>Information Processing Letters</title>
<publicationDate>1994</publicationDate>
</host>
<title>Haskell Overloading is DEXPTIME Complete</title>
<publicationDate>1994</publicationDate>
</json:item>
<json:item><author><json:item><name>F Seynhaeve</name>
</json:item>
<json:item><name>S Tison</name>
</json:item>
<json:item><name>M Tommasi</name>
</json:item>
</author>
<host><pages><last>487</last>
<first>475</first>
</pages>
<author></author>
<title>Proceedings of the twelfth International Conference on Fundamentals of Computation theory, number 1684 in Lecture Notes in Computer Science</title>
<publicationDate>1999</publicationDate>
</host>
<title>Homomorphisms and concurrent term rewriting</title>
<publicationDate>1999</publicationDate>
</json:item>
</refBibs>
<genre><json:string>conference</json:string>
</genre>
<serie><editor><json:item><name>Gerhard Goos</name>
<affiliations><json:string>Karlsruhe University, Germany</json:string>
</affiliations>
</json:item>
<json:item><name>Juris Hartmanis</name>
<affiliations><json:string>Cornell University, NY, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Jan van Leeuwen</name>
<affiliations><json:string>Utrecht University, The Netherlands</json:string>
</affiliations>
</json:item>
</editor>
<issn><json:string>0302-9743</json:string>
</issn>
<language><json:string>unknown</json:string>
</language>
<title>Lecture Notes in Computer Science</title>
<copyrightDate>2001</copyrightDate>
</serie>
<host><editor><json:item><name>Furio Honsell</name>
<affiliations><json:string>Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100, Udine, Italy</json:string>
<json:string>E-mail: honsell@dimi.uniud.it</json:string>
</affiliations>
</json:item>
<json:item><name>Marino Miculan</name>
<affiliations><json:string>Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100, Udine, Italy</json:string>
<json:string>E-mail: miculan@dimi.uniud.it</json:string>
</affiliations>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Logics and Meanings of Programs</value>
</json:item>
<json:item><value>Mathematical Logic and Formal Languages</value>
</json:item>
<json:item><value>Computation by Abstract Devices</value>
</json:item>
<json:item><value>Programming Languages, Compilers, Interpreters</value>
</json:item>
<json:item><value>Software Engineering</value>
</json:item>
</subject>
<isbn><json:string>978-3-540-41864-1</json:string>
</isbn>
<language><json:string>unknown</json:string>
</language>
<title>Foundations of Software Science and Computation Structures</title>
<bookId><json:string>3-540-45315-6</json:string>
</bookId>
<volume>2030</volume>
<pages><last>229</last>
<first>214</first>
</pages>
<issn><json:string>0302-9743</json:string>
</issn>
<genre><json:string>book-series</json:string>
</genre>
<eisbn><json:string>978-3-540-45315-4</json:string>
</eisbn>
<copyrightDate>2001</copyrightDate>
<doi><json:string>10.1007/3-540-45315-6</json:string>
</doi>
</host>
<publicationDate>2001</publicationDate>
<copyrightDate>2001</copyrightDate>
<doi><json:string>10.1007/3-540-45315-6_14</json:string>
</doi>
<id>D0F06663F37BD2DA6FD46040AAABE57C9E035ED8</id>
<score>0.6212701</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/document/D0F06663F37BD2DA6FD46040AAABE57C9E035ED8/fulltext/pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/document/D0F06663F37BD2DA6FD46040AAABE57C9E035ED8/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/D0F06663F37BD2DA6FD46040AAABE57C9E035ED8/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Synchronized Tree Languages Revisited and New Applications</title>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<publisher>Springer Berlin Heidelberg</publisher>
<pubPlace>Berlin, Heidelberg</pubPlace>
<availability><p>Springer-Verlag Berlin Heidelberg, 2001</p>
</availability>
<date>2001</date>
</publicationStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Synchronized Tree Languages Revisited and New Applications</title>
<author xml:id="author-1"><persName><forename type="first">Valérie</forename>
<surname>Gouranton</surname>
</persName>
<email>emgouranto@lifo.univ-orleans.fr</email>
<affiliation>LIFO, Université d’Orléans, France</affiliation>
</author>
<author xml:id="author-2"><persName><forename type="first">Pierre</forename>
<surname>Réty</surname>
</persName>
<email>rety@lifo.univ-orleans.fr</email>
<affiliation>LIFO, Université d’Orléans, France</affiliation>
</author>
<author xml:id="author-3"><persName><forename type="first">Helmut</forename>
<surname>Seidl</surname>
</persName>
<email>seidl@psi.uni-trier.de</email>
<affiliation>Dept. of Computer Science, University of Trier, Germany</affiliation>
</author>
</analytic>
<monogr><title level="m">Foundations of Software Science and Computation Structures</title>
<title level="m" type="sub">4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2–6, 2001 Proceedings</title>
<idno type="pISBN">978-3-540-41864-1</idno>
<idno type="eISBN">978-3-540-45315-4</idno>
<idno type="pISSN">0302-9743</idno>
<idno type="DOI">10.1007/3-540-45315-6</idno>
<idno type="book-ID">3-540-45315-6</idno>
<idno type="book-title-ID">67006</idno>
<idno type="book-sequence-number">2030</idno>
<idno type="book-volume-number">2030</idno>
<idno type="book-chapter-count">27</idno>
<editor><persName><forename type="first">Furio</forename>
<surname>Honsell</surname>
</persName>
<email>honsell@dimi.uniud.it</email>
<affiliation>Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100, Udine, Italy</affiliation>
</editor>
<editor><persName><forename type="first">Marino</forename>
<surname>Miculan</surname>
</persName>
<email>miculan@dimi.uniud.it</email>
<affiliation>Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100, Udine, Italy</affiliation>
</editor>
<imprint><publisher>Springer Berlin Heidelberg</publisher>
<pubPlace>Berlin, Heidelberg</pubPlace>
<date type="published" when="2001-03-23"></date>
<biblScope unit="volume">2030</biblScope>
<biblScope unit="page" from="214">214</biblScope>
<biblScope unit="page" to="229">229</biblScope>
</imprint>
</monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">Gerhard</forename>
<surname>Goos</surname>
</persName>
<affiliation>Karlsruhe University, Germany</affiliation>
</editor>
<editor><persName><forename type="first">Juris</forename>
<surname>Hartmanis</surname>
</persName>
<affiliation>Cornell University, NY, USA</affiliation>
</editor>
<editor><persName><forename type="first">Jan</forename>
<surname>van Leeuwen</surname>
</persName>
<affiliation>Utrecht University, The Netherlands</affiliation>
</editor>
<biblScope><date>2001</date>
</biblScope>
<idno type="pISSN">0302-9743</idno>
<idno type="series-Id">558</idno>
</series>
<idno type="istex">D0F06663F37BD2DA6FD46040AAABE57C9E035ED8</idno>
<idno type="DOI">10.1007/3-540-45315-6_14</idno>
<idno type="ChapterID">14</idno>
<idno type="ChapterID">Chap14</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><creation><date>2001</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>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.</p>
</abstract>
<textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass><keywords scheme="Book-Subject-Group"><list><label>I</label>
<label>I1603X</label>
<label>I16048</label>
<label>I16013</label>
<label>I14037</label>
<label>I14029</label>
<item><term>Computer Science</term>
</item>
<item><term>Logics and Meanings of Programs</term>
</item>
<item><term>Mathematical Logic and Formal Languages</term>
</item>
<item><term>Computation by Abstract Devices</term>
</item>
<item><term>Programming Languages, Compilers, Interpreters</term>
</item>
<item><term>Software Engineering</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc><change when="2001-03-23">Published</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-23">References added</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-21">References added</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/document/D0F06663F37BD2DA6FD46040AAABE57C9E035ED8/fulltext/txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName>
<PublisherLocation>Berlin, Heidelberg</PublisherLocation>
</PublisherInfo>
<Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID>
<SeriesPrintISSN>0302-9743</SeriesPrintISSN>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName>
<FamilyName>Goos</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName>
<FamilyName>Hartmanis</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName>
<Particle>van</Particle>
<FamilyName>Leeuwen</FamilyName>
</EditorName>
</Editor>
<Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName>
<OrgAddress><Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>Cornell University</OrgName>
<OrgAddress><State>NY</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName>
<OrgAddress><Country>The Netherlands</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-45315-6</BookID>
<BookTitle>Foundations of Software Science and Computation Structures</BookTitle>
<BookSubTitle>4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2–6, 2001 Proceedings</BookSubTitle>
<BookVolumeNumber>2030</BookVolumeNumber>
<BookSequenceNumber>2030</BookSequenceNumber>
<BookDOI>10.1007/3-540-45315-6</BookDOI>
<BookTitleID>67006</BookTitleID>
<BookPrintISBN>978-3-540-41864-1</BookPrintISBN>
<BookElectronicISBN>978-3-540-45315-4</BookElectronicISBN>
<BookChapterCount>27</BookChapterCount>
<BookHistory><OnlineDate><Year>2001</Year>
<Month>3</Month>
<Day>23</Day>
</OnlineDate>
</BookHistory>
<BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2001</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I1603X" Priority="1" Type="Secondary">Logics and Meanings of Programs</BookSubject>
<BookSubject Code="I16048" Priority="2" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject>
<BookSubject Code="I16013" Priority="3" Type="Secondary">Computation by Abstract Devices</BookSubject>
<BookSubject Code="I14037" Priority="4" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject>
<BookSubject Code="I14029" Priority="5" Type="Secondary">Software Engineering</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
<BookContext><SeriesID>558</SeriesID>
</BookContext>
</BookInfo>
<BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Furio</GivenName>
<FamilyName>Honsell</FamilyName>
</EditorName>
<Contact><Email>honsell@dimi.uniud.it</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Marino</GivenName>
<FamilyName>Miculan</FamilyName>
</EditorName>
<Contact><Email>miculan@dimi.uniud.it</Email>
</Contact>
</Editor>
<Affiliation ID="Aff4"><OrgDivision>Dipartimento di Matematica e Informatica</OrgDivision>
<OrgName>Università di Udine</OrgName>
<OrgAddress><Street>Via delle Scienze 206</Street>
<Postcode>33100</Postcode>
<City>Udine</City>
<Country>Italy</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</BookHeader>
<Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID>
<PartSequenceNumber>2</PartSequenceNumber>
<PartTitle>Contributed Papers</PartTitle>
<PartChapterCount>25</PartChapterCount>
<PartContext><SeriesID>558</SeriesID>
<BookID>3-540-45315-6</BookID>
<BookTitle>Foundations of Software Science and Computation Structures</BookTitle>
</PartContext>
</PartInfo>
<Chapter ID="Chap14" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>14</ChapterID>
<ChapterDOI>10.1007/3-540-45315-6_14</ChapterDOI>
<ChapterSequenceNumber>14</ChapterSequenceNumber>
<ChapterTitle Language="En">Synchronized Tree Languages Revisited and New Applications</ChapterTitle>
<ChapterFirstPage>214</ChapterFirstPage>
<ChapterLastPage>229</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2001</CopyrightYear>
</ChapterCopyright>
<ChapterHistory><RegistrationDate><Year>2001</Year>
<Month>3</Month>
<Day>22</Day>
</RegistrationDate>
<OnlineDate><Year>2001</Year>
<Month>3</Month>
<Day>23</Day>
</OnlineDate>
</ChapterHistory>
<ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ChapterGrants>
<ChapterContext><SeriesID>558</SeriesID>
<PartID>2</PartID>
<BookID>3-540-45315-6</BookID>
<BookTitle>Foundations of Software Science and Computation Structures</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Valérie</GivenName>
<FamilyName>Gouranton</FamilyName>
</AuthorName>
<Contact><Email>emgouranto@lifo.univ-orleans.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Pierre</GivenName>
<FamilyName>Réty</FamilyName>
</AuthorName>
<Contact><Email>rety@lifo.univ-orleans.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Helmut</GivenName>
<FamilyName>Seidl</FamilyName>
</AuthorName>
<Contact><Email>seidl@psi.uni-trier.de</Email>
</Contact>
</Author>
<Affiliation ID="Aff5"><OrgName>LIFO, Université d’Orléans</OrgName>
<OrgAddress><Country>France</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff6"><OrgDivision>Dept. of Computer Science</OrgDivision>
<OrgName>University of Trier</OrgName>
<OrgAddress><Country>Germany</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>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 <Emphasis Type="Italic">L</Emphasis>
<Subscript>1</Subscript>
(synchronized), <Emphasis Type="Italic">L</Emphasis>
<Subscript>2</Subscript>
(regular), <Emphasis Type="Italic">Rel</Emphasis>
(<Emphasis Type="Italic">L</Emphasis>
<Subscript>1</Subscript>
) ⊆ <Emphasis Type="Italic">L</Emphasis>
<Subscript>2</Subscript>
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.</Para>
</Abstract>
<KeywordGroup Language="En"><Heading>Keywords</Heading>
<Keyword>tree-tuple language</Keyword>
<Keyword>rewriting</Keyword>
<Keyword>concurrency</Keyword>
</KeywordGroup>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Synchronized Tree Languages Revisited and New Applications</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA" lang="en"><title>Synchronized Tree Languages Revisited and New Applications</title>
</titleInfo>
<name type="personal"><namePart type="given">Valérie</namePart>
<namePart type="family">Gouranton</namePart>
<affiliation>LIFO, Université d’Orléans, France</affiliation>
<affiliation>E-mail: emgouranto@lifo.univ-orleans.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Pierre</namePart>
<namePart type="family">Réty</namePart>
<affiliation>LIFO, Université d’Orléans, France</affiliation>
<affiliation>E-mail: rety@lifo.univ-orleans.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Helmut</namePart>
<namePart type="family">Seidl</namePart>
<affiliation>Dept. of Computer Science, University of Trier, Germany</affiliation>
<affiliation>E-mail: seidl@psi.uni-trier.de</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="conference" displayLabel="OriginalPaper"></genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2001-03-23</dateIssued>
<copyrightDate encoding="w3cdtf">2001</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<physicalDescription><internetMediaType>text/html</internetMediaType>
</physicalDescription>
<abstract lang="en">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.</abstract>
<relatedItem type="host"><titleInfo><title>Foundations of Software Science and Computation Structures</title>
<subTitle>4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2–6, 2001 Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Furio</namePart>
<namePart type="family">Honsell</namePart>
<affiliation>Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100, Udine, Italy</affiliation>
<affiliation>E-mail: honsell@dimi.uniud.it</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Marino</namePart>
<namePart type="family">Miculan</namePart>
<affiliation>Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100, Udine, Italy</affiliation>
<affiliation>E-mail: miculan@dimi.uniud.it</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" displayLabel="Proceedings"></genre>
<originInfo><copyrightDate encoding="w3cdtf">2001</copyrightDate>
<issuance>monographic</issuance>
</originInfo>
<subject><genre>Book-Subject-Collection</genre>
<topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic>
</subject>
<subject><genre>Book-Subject-Group</genre>
<topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic>
</subject>
<identifier type="DOI">10.1007/3-540-45315-6</identifier>
<identifier type="ISBN">978-3-540-41864-1</identifier>
<identifier type="eISBN">978-3-540-45315-4</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="BookTitleID">67006</identifier>
<identifier type="BookID">3-540-45315-6</identifier>
<identifier type="BookChapterCount">27</identifier>
<identifier type="BookVolumeNumber">2030</identifier>
<identifier type="BookSequenceNumber">2030</identifier>
<identifier type="PartChapterCount">25</identifier>
<part><date>2001</date>
<detail type="part"><title>Contributed Papers</title>
</detail>
<detail type="volume"><number>2030</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>214</start>
<end>229</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
</titleInfo>
<name type="personal"><namePart type="given">Gerhard</namePart>
<namePart type="family">Goos</namePart>
<affiliation>Karlsruhe University, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Juris</namePart>
<namePart type="family">Hartmanis</namePart>
<affiliation>Cornell University, NY, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jan</namePart>
<namePart type="family">van Leeuwen</namePart>
<affiliation>Utrecht University, The Netherlands</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><copyrightDate encoding="w3cdtf">2001</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">D0F06663F37BD2DA6FD46040AAABE57C9E035ED8</identifier>
<identifier type="DOI">10.1007/3-540-45315-6_14</identifier>
<identifier type="ChapterID">14</identifier>
<identifier type="ChapterID">Chap14</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2001</accessCondition>
<recordInfo><recordContentSource>SPRINGER</recordContentSource>
<recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</mods>
</metadata>
</istex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001136 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001136 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= Istex |étape= Corpus |type= RBID |clé= ISTEX:D0F06663F37BD2DA6FD46040AAABE57C9E035ED8 |texte= Synchronized Tree Languages Revisited and New Applications }}
![]() | This area was generated with Dilib version V0.6.31. | ![]() |