The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
We investigate, in a process algebraic setting, a new notion of compliance that we call strong service compliance: composed services are strong compliant if their composition is bo...
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...