FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Given two simplicial complexes C1 and C2 embedded in Euclidean space IRd , C1 subdivides C2 if (i) C1 and C2 have the same underlying space, and (ii) every simplex in C1 ...
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
When studying a 3D polyhedron, it is often easier to cut it open and
atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
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...
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
We introduce ctm, a process calculus which embodies a notion of trust for global computing systems. In ctm each principal (location) is equipped with a policy, which determines its...
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove ...
FSTTCS
2004
Springer
14 years 5 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...