CSP, partial automata, and coalgebras

@article{Wolter2002CSPPA,
  title={CSP, partial automata, and coalgebras},
  author={Uwe Wolter},
  journal={Theor. Comput. Sci.},
  year={2002},
  volume={280},
  pages={3-34}
}
The paper presents a %rst reconstruction of Hoare’s theory of CSP in terms of partial automata and related coalgebras. We show that the concepts of processes in Hoare (Communicating Sequential Processes, Prentice-Hall, Englewood Cli-s, NJ, 1985) are strongly related to the concepts of states for special, namely, %nal partial automata. Moreover, we show how the deterministic and nondeterministic operations in Hoare (1985) can be interpreted in a compatible way by constructions on the semantical… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Universal coalgebra: a theory of systems

Theor. Comput. Sci. • 2000
View 20 Excerpts
Highly Influenced

Functorial operational semantics and its denotational dual

D. Turi
Ph.D. Thesis, Free Univ. Amsterdam • 1996
View 20 Excerpts
Highly Influenced

Communicating Sequential Processes

View 12 Excerpts
Highly Influenced

Automata and Coinduction (An Exercise in Coalgebra)

CONCUR • 1998
View 3 Excerpts
Highly Influenced

Algebraic theory of processes

MIT Press series in the foundations of computing • 1988
View 3 Excerpts
Highly Influenced

A coalgebraic introduction to CSP

Electr. Notes Theor. Comput. Sci. • 1999
View 2 Excerpts

A hidden agenda, Tech. Report CS97-538

J. Goguen, G. Malcom
UCSD, Dept. Computer Science & Eng., • 1997
View 1 Excerpt

Models for Concurrency

MFCS • 1991
View 2 Excerpts

Similar Papers

Loading similar papers…