A process algebra for the Span(Graph) model of concurrency
| dc.creator | Katis, P. | |
| dc.creator | Sabadini, N. | |
| dc.creator | Walters, R. F. C. | |
| dc.date | 2009-04-25 | |
| dc.date.accessioned | 2026-07-07T13:08:49Z | |
| dc.date.available | 2026-07-07T13:08:49Z | |
| dc.description | 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]. | |
| dc.description | This is a updated version of an unpublished document written in 2000. It was also contained in the report of an Italian project: ART 2008, Analysing Reduction systems using Transition systems, Forum, Udine, 2008 | |
| dc.identifier | https://arxiv.org/abs/0904.3964 | |
| dc.identifier | http://arxiv.org/abs/0904.3964 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/228541 | |
| dc.subject | Category Theory | |
| dc.title | A process algebra for the Span(Graph) model of concurrency | |
| dc.type | text |