A process algebra based framework for promise theory
Jan Bergstra, Inge Bethke, Mark Burgess

TL;DR
This paper introduces a process algebra framework to formalize interactions and promises among computing devices, aiding in policy representation and conflict resolution, demonstrated through a transportation problem example.
Contribution
It presents a novel process algebra approach to model promises and interactions, enhancing formal reasoning in distributed systems.
Findings
Formalization of promise interactions using process algebra
Application to a transportation agreement scenario
Improved understanding of conflict resolution mechanisms
Abstract
We present a process algebra based approach to formalize the interactions of computing devices such as the representation of policies and the resolution of conflicts. As an example we specify how promises may be used in coming to an agreement regarding a simple though practical transportation problem.
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
TopicsAdvanced Software Engineering Methodologies · Formal Methods in Verification · Multi-Agent Systems and Negotiation
