On Finite Bases for Weak Semantics: Failures versus Impossible Futures
Taolue Chen, Wan Fokkink, Rob van Glabbeek
TL;DR
This paper establishes finite axiomatizations for weak semantics in process algebra BCCS, highlighting both successes and limitations in axiomatizability for various weak semantics.
Contribution
It provides a finite basis for weak failures semantics and explores axiomatizability issues for weak impossible futures semantics in BCCS.
Findings
Finite basis for weak failures semantics established.
Positive results for axiomatizability of weak failures.
Negative results for axiomatizability of weak impossible futures.
Abstract
We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.
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
TopicsFormal Methods in Verification · Logic, programming, and type systems · Logic, Reasoning, and Knowledge