2009/04/25 by Piergiulio Katis, P. Katis, Katis, P. +4 · 1 citation
Computer Science · Mathematics · #Category Theory (math.CT) #FOS: Mathematics #Formal Methods in Verification #Logic, programming, and type systems #Petri Nets in System Modeling #math.CT
paper · pdf · doi:10.48550/arxiv.0904.3964
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
arxiv created 2009/04/25 · openalex publication_date 2009/04/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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].