Combinatorics on traces
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Towards a Sheaf Semantics for Cooperating Agents Scenarios
AISMC-3 Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation
Higher dimensional automata revisited
Mathematical Structures in Computer Science
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Applications of Hierarchical Reasoning in the Verification of Complex Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic verification of parametric specifications with complex topologies
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
| Hi-index | 0.00 |
In this paper we show that states, transitions and behavior of concurrent systems can often be modeled as sheaves over a suitable topological space. In this context, geometric logic can be used to describe which local properties, of individual systems, are preserved, at a global level, when interconnecting the systems. The main area of application is to modular verification of complex systems. We illustrate the ideas by means of an example involving a family of interacting controllers for trains on a rail track.