Possible and Guaranteed Concurrency in Csp


As part of an eeort to give a \truly concurrent" semantics to process algebra, we propose a framework of reenements of the failures model for CSP with con-currency, connict and causality relations on traces. These relations are deened by induction over syntax of CSP processes. We study in detail two new semantics: the possible concurrency (where two traces… (More)


  • Presentations referencing similar topics