What is a good process semantics?

Authors:
Robin Cockett
Affiliations:
Dept. of Computer Science, University of Calgary, Calgary, Alb., Canada
Venue:
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Year:
2006

Citing 5
Cited 0

A calculus of mobile processes, I

Information and Computation
A calculus of mobile processes, II

Information and Computation
On the &pgr;-calculus and linear logic

MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Proof nets for unit-free multiplicative-additive linear logic

ACM Transactions on Computational Logic (TOCL)
A Language For Multiplicative-additive Linear Logic

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current mathematical tools for understanding processes predominantly support process modeling. In particular, they faithully represent all the things that can go wrong (deadlock, livelock, etc.). However, for the development of good programming abstractions in concurrent (and other) setting it is important to focus on formal systems in which things do not go wrong. So what are the formal models of processes where nothing goes wrong?