Investigation of concurrent processes by means of homotopy functors

Authors:
Stefan Sokołowski
Affiliations:
Institute of Computer Science, Polish Academy of Sciences, Gdańsk Division, ul. Abrahama 18, 81-825 Sopot, Poland Email: stefan@ipipan.gda.pl
Venue:
Mathematical Structures in Computer Science
Year:
2002

Citing 7
Cited 0

Modeling concurrency with geometry

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algebraic spans

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Towards a topological characterization of asynchronous complexity

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Detecting Deadlocks in Concurrent Systems

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Homology of Higher Dimensional Automata

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Categories of asynchronous systems

Categories of asynchronous systems
Loops, ditopology and deadlocks

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show a method for translating concurrent systems into partially ordered sets in a functorial way. This is done in a way resembling the construction of the fundamental groups in topology. Since the morphisms of concurrent systems have a flavour of the implementability of one system in another, the functor provides a tool for proving certain non-implementability results.