Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear tim...
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each othe...
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....