Conway's law, revised from a mathematical viewpoint
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916132750884864 |
|---|---|
| author | Matsutani, Shigeki Ohmori, Shousuke Hiranabe, Kenji Hanyuda, Eiichi |
| author_facet | Matsutani, Shigeki Ohmori, Shousuke Hiranabe, Kenji Hanyuda, Eiichi |
| contents | In this article, we revise Conway's Law from a mathematical point of view. By introducing a task graph, we first rigorously state Conway's Law based on the homomorphisms in graph theory for the software system and the organizations that created it. Though Conway did not mention it, the task graph shows the geometric structure of tasks, which plays a crucial role. Furthermore, due to recent requirements for high-level treatment of communication (due to security, knowledge hiding, etc.) in organizations and hierarchical treatment of organizations, we have reformulated these statements in terms of weakened homomorphisms, and the continuous maps in graph topology. In order to use graph topology and the continuous map in Conway's law, we have prepared them as mathematical tools, and then we show the natural expression of Conway's correspondences with hierarchical structures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_10475 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Conway's law, revised from a mathematical viewpoint Matsutani, Shigeki Ohmori, Shousuke Hiranabe, Kenji Hanyuda, Eiichi Software Engineering Computers and Society General Topology In this article, we revise Conway's Law from a mathematical point of view. By introducing a task graph, we first rigorously state Conway's Law based on the homomorphisms in graph theory for the software system and the organizations that created it. Though Conway did not mention it, the task graph shows the geometric structure of tasks, which plays a crucial role. Furthermore, due to recent requirements for high-level treatment of communication (due to security, knowledge hiding, etc.) in organizations and hierarchical treatment of organizations, we have reformulated these statements in terms of weakened homomorphisms, and the continuous maps in graph topology. In order to use graph topology and the continuous map in Conway's law, we have prepared them as mathematical tools, and then we show the natural expression of Conway's correspondences with hierarchical structures. |
| title | Conway's law, revised from a mathematical viewpoint |
| topic | Software Engineering Computers and Society General Topology |
| url | https://arxiv.org/abs/2311.10475 |