A calculus for dynamic reconfiguration with low priority linking
From MaRDI portal
Publication:2848693
Recommendations
- A calculus for reconfiguration (extended abstract)
- Towards a calculus for dynamic architectures
- Theoretical Computer Science
- Dynamic reconfiguration: abstraction and optimal asynchronous solution
- scientific article; zbMATH DE number 1538030
- scientific article; zbMATH DE number 2089408
- Development of a run-time reconfiguration system with low reconfiguration overhead
Cited in
(6)- A calculus of open modules: call-by-need strategy and confluence
- scientific article; zbMATH DE number 1538030 (Why is no real title available?)
- Theoretical Computer Science
- scientific article; zbMATH DE number 2163036 (Why is no real title available?)
- scientific article; zbMATH DE number 125114 (Why is no real title available?)
- A calculus for reconfiguration (extended abstract)
This page was built for publication: A calculus for dynamic reconfiguration with low priority linking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848693)