Semantics for finite delay

Theoretical Computer Science

Volumn 176, Issue 1-2, 1997, Pages 205-234

  Hartonas, Chrysafis ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; RECURSIVE FUNCTIONS; THEOREM PROVING;

FAIR BISIMILARITY; FINITE DELAY OPERATOR;

COMPUTATIONAL LINGUISTICS;

EID: 0031119509     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00095-3     Document Type: Article

References (27)

1. P. Aczel, Non-well-founded Sets, CSLI Lecture Notes Series, number 14 (CSLI, Stanford, 1988).
2. P. Aczel, Final Universes of Processes, Lecture Notes in Computer Science, Vol. 802 (Springer, Berlin, 1994) 1-28.
3. P. Aczel and N. Mendler, A Final Coalgebra Theorem, Lecture Notes in Computer Science, Vol. 389 (Springer, Berlin, 1989) 357-366.
4. M. Barr, Terminal coalgebras for endofunctors on sets, Theoret. Comput. Sci. 114 (1993) 299-315.
5. J. Barwise, Admissible Sets and Structures (Springer, Berlin, 1975).
6. J. Barwise and L. Moss, Vicious Circles: On the Mathematics of Non-Well-Founded Phenomena, CSLI Lecture Notes Series (CSLI, Stanford, 1996).
7. E. Clarke and O. Grumberg. Research on automatic verification of finite-state concurrent systems, Ann. Rev. Comp. Sci. 2 (1987) 269-290.
8. R. DeNicola and M. Hennessy, Testing equivalences for processes, Theoret. Comput. Sci. 34 (1984) 83-133.
9. N. Francez, Fairness (Springer, Berlin, 1986).
10. C. Hartonas and M. Kwiatkowska, Synchronization trees and fairness: a case study, in: C.L. Hankin, I. Mackie and R. Nagarajan, eds., Proc. 2nd Imperial College, Department of Computing, Workshop on Theory and Formal Methods (World Scientific, Singapore, 1995).
11. M. Hennessy, A term model for synchronous processes, Inform. and Control 51 (1981) 58-75.
12. M. Hennessy, Modeling finite delay operators, Tech. Report CSR-153-83, University of Edinburgh, 1983.
13. M. Hennessy, Axiomatizing finite delay operators, Acta Inform. 21 (1984) 61-88.
14. M. Hennessy, Acceptance trees, J. Assoc. Comput. Mach. 32 (1985) 897-928.
15. M. Hennessy, An algebraic theory of fair asynchronous communicating processes, Theoret. Comput. Sci. 49 (1987) 121-143.
16. M. Hennessy, Algebraic Theory of Processes (MIT Press, Cambridge, MA, 1988).
17. M. Hennessy and R. Milner, Algebraic laws for nondeterminisim and concurrency, J. Assoc. Comput. Mach. 32 (1985) 137-161.
18. R. Milner, Calculi for synchrony and asynchrony, Tech. Report CSR-104-82, University of Edinburgh, 1982.
19. R. Milner, A finite delay operator in synchronous CCS, Tech. Report CSR-116-82, University of Edinburgh, 1982.
20. R. Milner, Communication and Concurrency (Prentice-Hall, Englewood Cliffs, NJ, 1989).
21. D. Park, On the Semantics of Fair Parallelism, Lecture Notes in Computer Science, Vol. 86 (Springer, Berlin, 1980).
22. J.J.M.M. Rutten, Nonwellfounded Sets and Programming Language Semantics, Lecture Notes in Computer Science, Vol. 598 (Springer, Berlin, 1992) 193-206.
23. J.J.M.M. Rutten, A structural co-induction theorem, Tech. Report, CWI, CS-R9346 1993, Amsterdam.
24. J.J.M.M. Rutten and D. Turi, On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders, Lecture Notes in Computer Science, Vol. 666 (Springer, Berlin, 1993).
25. J.J.M.M. Rutten and D. Turi, Initial algebra and final coalgebra semantics for concurrency, in: J. de Bakker et al. eds., Proc. REX Workshop, A Decade of Concurrency - Reflections and Perspectives, Lecture Notes in Computer Science, Vol. 803 (Springer, Berlin, 1994) 530-582.
26. G. Winskel, Synchronization trees, Theoret. Comput. Sci. 34 (1984) 33-82.
27. G. Winskel, Generalized trees to give denotational semantics to finite delay, unpublished manuscript.