Relating Reasoning Methodologies in Linear Logic and Process Algebra
Logic in Computer Science
2019-02-20 v1
Abstract
We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The argument makes use of other standard notions in process algebra, namely a labeled transition system and a coinductively defined simulation relation. This result establishes a connection between an approach to reason about process specifications and a method to reason about logic specifications.
Cite
@article{arxiv.1211.4100,
title = {Relating Reasoning Methodologies in Linear Logic and Process Algebra},
author = {Yuxin Deng and Iliano Cervesato and Robert J. Simmons},
journal= {arXiv preprint arXiv:1211.4100},
year = {2019}
}
Comments
In Proceedings LINEARITY 2012, arXiv:1211.3480