Hostname: page-component-8448b6f56d-dnltx Total loading time: 0 Render date: 2024-04-18T13:54:39.091Z Has data issue: false hasContentIssue false
  • English
  • Français

Investigation of concurrent processes by means of homotopy functors

Published online by Cambridge University Press:  21 October 2002

STEFAN SOKOŁOWSKI
STEFAN SOKOŁOWSKI
Affiliation:
Institute of Computer Science, Polish Academy of Sciences, Gdańsk Division, ul. Abrahama 18, 81-825 Sopot, Poland Email: stefan@ipipan.gda.pl
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 12 , Issue 5 , October 2002 , pp. 665 - 699
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This paper is a thoroughly revised and updated version of Sokołowski (1998a).