Process Algebra Based Tool Coordination Architectures in Raku and Go
Bob Diertens

TL;DR
This paper explores implementing tool coordination architectures based on process algebra using Raku and Go, demonstrating their application in a simulator and highlighting concurrency support in both languages.
Contribution
It introduces new tool coordination architectures based on the ToolBus in Raku and Go, extending process algebra applications in software engineering.
Findings
Successful implementation of ToolBus primitives in Raku and Go
Application of architectures to a small example
Implementations of the simulator in both languages
Abstract
This paper presents ongoing research in our project software engineering with process algebra. In this project we have developed among others a reimplementation of the simulator from the PSF Toolkit, a set of tools for the Process Specification formalism (PSF). This new simulator uses the ToolBus, a tool coordination architecture based on process algebra. We now developed new tool coordination architectures based on this ToolBus. We implement the primitives of the ToolBus in the programming languages Raku and Go. Both these languages have support for concurrency and communication between concurrent entities in the form of channels. We apply these tool coorination architectures on a small example. And we give implementations for the simulator in the PSF Toolkit based on the tool coordination architectures in Raku and Go.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCognitive Computing and Networks · Computability, Logic, AI Algorithms · Semantic Web and Ontologies
