An Algebraic Approach for Approximity
Logic in Computer Science
2015-12-01 v1
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.
Cite
@article{arxiv.1511.09186,
title = {An Algebraic Approach for Approximity},
author = {Yong Wang},
journal= {arXiv preprint arXiv:1511.09186},
year = {2015}
}