Calculi for synchrony and asynchrony

Theoretical Computer Science - Tập 25 - Trang 267-310 - 1983
Robin Milner1
1Department of Computer Science, Edinburgh University, Edinburgh EH9 3JZ, United Kingdom

Tài liệu tham khảo

Cardelli, 1982-1982, Real time agents, 140, 94 Hoare, 1981 Hennessy, 1981, A term model for synchronous processes Hoare, 1978, A model for communicating sequential processes Hennessy, 1982, A term model for CCS, 88 Lamport, 1980, ‘Sometime’ is sometimes ‘not never’, Proc. 7th ACM Symposium on Principles of Programming Languages Milner, 1973, Processes; a mathematical model of computing agents, 157 Milner, 1980, A Calculus of Communicating Systems, 92 Milner, 1981, On relating synchrony and asynchrony Milner, 1982, A complete inference system for a class of regular behaviours Milner, 1982, Four combinators for concurrency, Proc. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 104, 10.1145/800220.806687 Milne, 1979 Milne, 1979, Concurrent processes and their syntax, J. ACM, 26, 302, 10.1145/322123.322134 Nielson, 1981, Petri nets, events structures and domains, Theoret. Comput. Sci., 13, 85, 10.1016/0304-3975(81)90112-2 Park, 1981, Concurrency and automata on infinite sequences, 104 Plotkin, 1981, A structured approach to operational semantics Pnueli, 1981, The temporal semantics of concurrent programs, Theoret. Comput. Sci., 13, 45, 10.1016/0304-3975(81)90110-9 Sanderson, 1982 Winskel, 1982, Event structure semantics for CCS and related languages, 140, 561