Axiomatizing L\"{u}ttgen and Vogler's ready simulation for finite processes in $\text{CLL}_R$
Logic in Computer Science
2015-02-13 v1
Abstract
In the framework of logic labelled transition system, a variant of weak ready simulation has been presented by L\"{u}ttgen and Vogler. It has been shown that such behavioural preorder is the largest precongruence w.r.t parallel and conjunction composition satisfying desired properties. This paper offers a ground-complete axiomatization for this precongruence over processes containing no recursion in the calculus . Compared with usual inference system for process calculus, in addition to axioms about process operators, such system contains a number of axioms to characterize the interaction between process operators and logical operators.
Keywords
Cite
@article{arxiv.1502.03636,
title = {Axiomatizing L\"{u}ttgen and Vogler's ready simulation for finite processes in $\text{CLL}_R$},
author = {Yan Zhang and Zhaohui Zhu and Jinjin Zhang},
journal= {arXiv preprint arXiv:1502.03636},
year = {2015}
}
Comments
25 pages