Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness

1984 ◽  
pp. 403-413 ◽  
Author(s):  
Wolfgang Reisig
Keyword(s):  
Partial Order ◽  
Interleaving Semantics ◽  
Partial Order Semantics

A Non-Interleaving Semantics for CCS Based on Proved Transitions

1988 ◽  
Vol 11 (4) ◽  
pp. 433-452 ◽  
Author(s):  
Gérard Boudol ◽  
Ilaria Castellani
Keyword(s):  
Partial Order ◽  
Transition Systems ◽  
Structural Rules ◽  
Labelled Transition Systems ◽  
Interleaving Semantics ◽  
Partial Order Semantics ◽  
The Given

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.

Sign in / Sign up

Export Citation Format

Share Document