Sémantique asynchrone et comportements infinis en CPS (Q1092652)

To a CSP program P, we associate an infinitary language I(P) which represents the finite and infinite behaviors of P; then we define a relation \(\sim\) on I(P): \(u\sim v\) if and only there is the same relation of causality between the actions of u and v. I(P)/\(\sim\) is an asynchronous semantics for the program P. This semantics can also be obtained by a communication relation, and we prove that \(u\sim v\) if and only if u and v have the same projections on each process. We studied the notions of fairness in this model, and we prove that we cannot realize a fair channel in CSP and, generally, we cannot simulate a program P by a centralized program (i.e., a program with a special process which manages the communications between processes).