2012/11/17 by Yuxin Deng, Iliano Cervesato, Robert J. Simmons
Computer Science · #cs.LO
paper · pdf · doi:10.1017/s0960129514000413
published as Math. Struct. Comp. Sci. 26 (2016) 868-906 · In Proceedings LINEARITY 2012, arXiv:1211.3480
arxiv created 2012/11/17 · arxiv updated 2019/02/20
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.