A process algebra for the Span(Graph) model of concurrency Export

@article{citeulike:4450880, abstract = {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].}, archivePrefix = {arXiv}, author = {Katis, P. and Sabadini, N. and Walters, R. F. C.}, citeulike-article-id = {4450880}, citeulike-linkout-0 = {http://arxiv.org/abs/0904.3964}, citeulike-linkout-1 = {http://arxiv.org/pdf/0904.3964}, eprint = {0904.3964}, keywords = {category-theory, computation, graphs}, month = {Apr}, posted-at = {2009-05-02 06:40:53}, priority = {2}, title = {A process algebra for the Span(Graph) model of concurrency}, url = {http://arxiv.org/abs/0904.3964}, year = {2009} }

TY - JOUR ID - citeulike:4450880 L3 - citeulike-article-id:4450880 N2 - 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]. TI - A process algebra for the Span(Graph) model of concurrency KW - category-theory KW - computation KW - graphs AU - Katis, P AU - Sabadini, N AU - Walters, RFC PY - 2009/Apr/25/ UR - http://arxiv.org/abs/0904.3964 ER -