Meadow enriched ACP process algebras
J. A. Bergstra, C. A. Middelburg

TL;DR
This paper introduces meadow enriched ACP process algebras, extending traditional ACP process algebras to include data using meadow structures, providing a new algebraic framework for data-involving processes.
Contribution
It defines meadow enriched ACP process algebras, generalizing ACP process algebras to incorporate data with meadow structures, expanding the algebraic modeling of processes.
Findings
Introduction of meadow enriched ACP process algebras
Extension of ACP models to data-involving processes
Foundation for algebraic analysis of data processes
Abstract
We introduce the notion of an ACP process algebra. The models of the axiom system ACP are the origin of this notion. ACP process algebras have to do with processes in which no data are involved. We also introduce the notion of a meadow enriched ACP process algebra, which is a simple generalization of the notion of an ACP process algebra to processes in which data are involved. In meadow enriched ACP process algebras, the mathematical structure for data is a meadow.
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
TopicsLogic, Reasoning, and Knowledge · Formal Methods in Verification · Advanced Algebra and Logic
