×

Axiomatising finite delay operators. (English) Zbl 0521.68047


MSC:

68Q45 Formal languages and automata
03D05 Automata and formal grammars in connection with logical questions
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Courcelle, B., Nivat, M.: Algebraic families of interpretations. IRIA Rapport de Recherche No. 189, 1976
[2] De Nicola, R., Hennessy, M.: Testing equivalences for processes. Lecture Notes in Computer Science, Vol. 154, pp. 548-560. Berlin-Heidelberg-New York: Springer · Zbl 0515.68029
[3] Gordon, M.: The Denotational description of programming languages. Berlin-Heidelberg-New York: Springer 1979 · Zbl 0412.68004
[4] Goguen, J.A., Thatcher, J.W., Wright, J.B.: Initial algebra semantics and continuous algebras. JACM 24, 68-95 (1977) · Zbl 0359.68018 · doi:10.1145/321992.321997
[5] Guessarian, I.: Algebraic semantics. Lecture Notes in Computer Science, Vol. 99. Berlin-Heidelberg-New York: Springer 1981 · Zbl 0474.68010
[6] Hennessy, M., Plotkin, G.: A term model for CCS. Lecture Notes in Computer Science, Vol. 88, pp. 261-274. Berlin-Heidelberg-New York: Springer 1980 · Zbl 0479.68011
[7] Hennessy, M.: A term model for synchronous process. Information and Control. 51(1), 58-75 (1981) · Zbl 0503.68022 · doi:10.1016/S0019-9958(81)90082-6
[8] Milner, R.: A calculus of communicating systems. Lecture Notes in Computer Science, Vol. 92. Berlin-Heidelberg-New York: Springer 1980 · Zbl 0452.68027
[9] Milner, R.: Calculi for synchrony and asvnchrony. Theoretical Computer Science. 25, 267-310 (1983) · Zbl 0512.68026 · doi:10.1016/0304-3975(83)90114-7
[10] Milner, R.: A finite delay operator in synchronous CCS. Technical Report CSR-116-82, Dept. of Computer Science, University of Edinburgh, 1982
[11] Milner, R.: On relating synchrony and asynchrony. Technical Report CSR-75-80, Dept. of Computer Science, University of Edinburgh, 1980
[12] Milner, R.: A complete inference system for a class of regular behaviours. Technical Report CSR-111-82, Dept. of Comp. Sci., Univ. of Edinburgh, 1982 · Zbl 0562.68065
[13] Park, D.: Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, Vol. 104. Berlin-Heidelberg-New York: Springer 1981 · Zbl 0457.68049
[14] Stoy, J.: Denotational semantics: The Scott-Strachey Approach to Programming. MIT Press, 1977 · Zbl 0503.68059
[15] Smyth, M., Powerdomains, JCCS 2, 23-36 (1978)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.