Concurrency

TraLaLa

Nov 2004 — Feb 2008. TraLaLA, XML Transformation Languages: logic and applications, is a project funded by ACI MASSES DE DONNÉES. The objectives of the project is to study the processing, querying and manipulation of _data-masses_ (large amounts of data) available in XML format.

A Typed Calculus for Querying Distributed XML Documents

We study the problems related to querying large, distributed XML documents. Our proposal takes the form of a new process calculus in which XML data are processes that can be queried by means of concurrent pattern-matching …

A Typed Calculus for Querying Distributed XML Documents

We study the problems related to querying large, distributed XML documents. Our proposal takes the form of a new process calculus in which XML data are processes that can be queried by means of concurrent pattern-matching …

On the Dynamics of PB Systems: A Petri Net View

We study dynamical properties of PB systems, a new computational model of biological processes, and propose a compositional encoding of PB systems into Petri nets. Building on this relation, we show that three properties: …

Model Checking Mobile Ambients

We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee …