Affiliation:
1. INRIA Sophia-Antipolis, 06560 Valbonne, France
Abstract
When using labelled transition systems to model languages like CCS or TCSP, one specifies transitions by a set of structural rules. We consider labelling transitions with their proofs – in the given system of rules – instead of simple actions. Then the label of a transition identifies uniquely that transition, and one may use this information to define a concurrency relation on (proved) transitions, and a notion of residual of a (proved) transition by a concurrent one. We apply Berry and Lévy’s notion of equivalence by permutations to sequences of proved transitions for CCS to obtain a partial order semantics for this language.
Subject
Computational Theory and Mathematics,Information Systems,Algebra and Number Theory,Theoretical Computer Science
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献