An Algebraic Approach for Approximity

TL;DR

This paper introduces an algebraic framework for approximate bisimilarity in process calculus, enabling efficient comparison of processes with acceptable approximation levels, thus supporting faster computations.

Contribution

It develops an algebraic approach for measuring distances between processes within the CCS calculus, extending previous work on process distances to approximate bisimilarity.

Findings

Supports a comprehensive process calculus with approximate comparisons

Provides a formal algebraic method for process distances

Enables analysis of process similarity with acceptable approximation

Abstract

Comparison to traditionally accurate computing, approximate computing focuses on the rapidity of the satisfactory solution, but not the unnecessary accuracy of the solution. Approximate bisimularity is the approximate one corresponding to traditionally accurate bisimilarity. Based on the work of distances between basic processes, we propose an algebraic approach for distances between processes to support a whole process calculus CCS, which contains prefix, sum, composition, restriction, relabeling and recursion.