Mathematics – Category Theory
Scientific paper
2009-04-25
Mathematics
Category Theory
This is a updated version of an unpublished document written in 2000. It was also contained in the report of an Italian projec
Scientific paper
In this note we define a process algebra TCP (Truly Concurrent Processes) which corresponds closely with the automata model of concurrency based on Span(RGraph), the category of spans of reflexive graphs. In TCP, each process has a fixed set of interfaces. Actions are allowed to occur simultaneously on all the interfaces of a process. Asynchrony is modelled by the use of silent actions. Communication is anonymous: communication between two processes P and Q is described by an operation which connects some of the ports of P to some of the ports of Q; and a process can only communicate with other processes via its interfaces. The model is naturally equipped with a compositional semantics in terms of the operations in Span(RGraph) introduced in [5], and developed in [6, 7, 10].
Katis Piergiulio
Sabadini N.
Walters R. F. C.
No associations
LandOfFree
A process algebra for the Span(Graph) model of concurrency does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A process algebra for the Span(Graph) model of concurrency, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A process algebra for the Span(Graph) model of concurrency will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-671287