Is your "joining" library a tool for implementing the results of a software concurrency analysis? Rather than something targeted at the implementation of the highly interactive entities in a telephony protocol?
Hello,
Join calculus , as a process calculus, has been used for formal specification and validation of concurrent and distributed systems, including protocols.
Its simple and well-defined core for concurrency (async / synch methods and join-patterns or chords) are well suited for programming and have been integrated with programming languages for real concurrent applications in two different ways: 1. Join's primitives are integrated into languages by changing compilers; such as JoCaml, Cw and Join.Java. 2. Join's primitives are added as a separate library; such as CCR, C#.Joins. The "Join" library i am proposing falls into this category.
It is intended for implementing real concurrent applications. Its simple model of async / synch methods and join-patterns (chords) should give us guideline for concurrent design and help avoiding pitfalls.
Sounds like something I should look into. I have used SDL for some telephony projects in the past and found it useful but as far as I'm aware it does not exist on any mathematical foundation. Could join calculus compete with something like SDL? Is there a join-calculus- for-programmers reference? Cheers.