multi-bsp is a bridging model for algorithm design which takes into account hierarchical architectures. We discuss two questions about multi-bsp algorithms and their programming: (1) How to obtain a formal characterization of the class of multi-bsp algorithms or at least a tree-based hierarchical extension of bsp inspired by multi-bsp? (2) How can a programming language be proven algorithmically complete for such a class? Our solution is based on an extension of a bsp version of sequential abstract state machines (asms).

中文翻译：

---

多 BSP 算法的公理化和命令式表征：关于部分解决方案的问答

multi-bsp 是一种用于算法设计的桥接模型，它考虑了分层架构。我们讨论关于多 bsp 算法及其编程的两个问题：（1）如何获得多 bsp 算法类的形式特征，或者至少是受多 bsp 启发的 bsp 的基于树的分层扩展？(2) 对于这样的类，如何证明一种编程语言在算法上是完备的？我们的解决方案基于 bsp 版本的顺序抽象状态机 (asms) 的扩展。