A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children. In 1993, Dutton showed that this data structure yields a simple worst-case-efficient sort...
详细信息
Model checking of timed automata is a widely used technique. But in order to take advantage of modern hardware, the algorithms need to be parallelized. We present a multi-core reachability algorithm for the more gener...
详细信息
For some graph classes, most notably real-world road networks, shortest path queries can be answered very efficiently if the graph is preprocessed into a contraction hierarchy. The preprocessing algorithm contracts no...
详细信息
We present a new abstraction technique for the exploration of graph transformation systems with infinite state spaces. This technique is based on patterns, simple graphs describing structures of interest that should b...
详细信息
In a context where graph transformation is used to explore a space of possible solutions to a given problem, it is almost always necessary to inspect candidate solutions for relevant properties. This means that there ...
详细信息
An infinte word w avoids a pattern p with the involution θ if there is no substitution for the variables in p and no involution θ such that the resulting word is a factor of w. We investigate the avoidance of patter...
详细信息
The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistently specified at various levels of abst...
详细信息
To date, software development for wireless sensor network nodes is still characterized by low-level ad-hoc programming to a large extent. This short-paper argues for a methodologically more systematic approach on the ...
详细信息
The task of implementing a supervisory controller is non-trivial, even though different theories exist that allow automatic synthesis of these controllers in the form of automata. One of the reasons for this discord i...
详细信息
暂无评论