6
votes
Accepted
Resources (books, etc) to learn about concurrency theory
There are not that many books on this subject, as it continues to evolve at a rapid pace.
Classic books on process calculi (that don't focus on π-calculus-like mobility) are:
C. A. R. Hoare, ...
- 11.4k
3
votes
Accepted
Is every countable, finite-branching LTS bisimilar to a tree?
Q1: Yes, every LTS is bisimilar to its unfolding, which is a tree.
Q2: No, by a cardinality argument. For instance take infinite binary trees with $L=\{a,b\}$. Each tree has countable set of states ...
- 8,598
1
vote
Use of Process Calculi and PL Theory for modern programming language development
I like to search for practical implementations of process calculi in the wild :) (besides reading about the theory).
Clojure async channels is based on CSP: http://clojure.com/blog/2013/06/28/clojure-...
- 11
Only top scored, non community-wiki answers of a minimum length are eligible