A model of concurrency with fair merge and full recursion
From MaRDI portal
(Redirected from Publication:808690)
Recommendations
Cites work
- scientific article; zbMATH DE number 3837349 (Why is no real title available?)
- scientific article; zbMATH DE number 4180791 (Why is no real title available?)
- scientific article; zbMATH DE number 3714908 (Why is no real title available?)
- scientific article; zbMATH DE number 3469994 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3581600 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- A Powerdomain Construction
- A calculus of communicating systems
- A theory for nondeterminism, parallelism, communication, and concurrency
- Calculi for synchrony and asynchrony
- Communicating sequential processes
- Computable concurrent processes
- Modeling concurrency with partial orders
- Power domains
- The formal language of recursion
Cited in
(7)- Fairness, resources, and separation
- Merging regular processes by means of fixed-point theory
- 1994 Annual Meeting of the Association for Symbolic Logic
- scientific article; zbMATH DE number 4180791 (Why is no real title available?)
- The logic of recursive equations
- Computable concurrent processes
- Games and winning strategies
This page was built for publication: A model of concurrency with fair merge and full recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808690)