Failures, finiteness and full abstraction

Electronic Notes in Theoretical Computer Science

Volumn 6, Issue , 1997, Pages 391-408

  Van Breugel, Franck ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SYSTEM RECOVERY; CONCURRENT ENGINEERING; FUNCTION EVALUATION; GRAPH THEORY; MATHEMATICAL MODELS; SET THEORY; SYNCHRONIZATION;

ABSTRACTION; CCS-LIKE LANGUAGES; CONCURRENT LANGUAGES; FAILURE SEMANTICS; TRACE SEMANTICS;

SEMANTICS;

EID: 18944381089     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80147-1     Document Type: Conference Paper

References (20)

1. Apt K.R., Plotkin G.D. Countable nondeterminism and random assignment. Journal of the ACM. 33:(4):October 1986;724-767
2. J.C.M. Baeten and R.J. van Glabbeek. Merge and termination in process algebra. In K.V. Nori, editor, Proceedings of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 287 of Lecture Notes in Computer Science, pages 153 - 172, Pune, December 1987. Springer-Verlag.
3. de Bakker J.W., de Vink E.P. Control Flow Semantics. Foundations of Computing Series. 1996;The MIT Press, Cambridge
4. Bergstra J.A., Klop J.W., Olderog E.-R. Readies and failures in the algebra of communicating processes. SIAM Journal on Computing. 17:(6):December 1988;1134-1177
5. F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The failure of failures in a paradigm for asynchronous communication. In J.C.M. Baeten and J.F. Groote, editors, Proceedings of CONCUR'91, volume 527 of Lecture Notes in Computer Science, pages 111 - 126, Amsterdam, August 1991. Springer-Verlag.
6. van Breugel F. A non fully abstract model for a language with synchronization. Unpublished lecture notes. September 1994
7. Brookes S.D., Hoare C.A.R., Roscoe A.W. A theory of communicating sequential processes. Journal of the ACM. 31:(3):July 1984;560-599
8. Finite/infinite action sets. Discussion on the concurrency forum, October 1996. Available at theory.lcs.mit.edu as /pub/people/meyer/concurrency.
9. Hennessy M. Algebraic Theory of Processes. Foundations of Computing Series. 1988;The MIT Press, Cambridge
10. Hoare C.A.R. Communicating Sequential Processes. 1985;Series in Computer Science. Prentice Hall International, London
11. E. Horita. Fully Abstract Models for Concurrent Languages. PhD thesis, Vrije Universiteit, Amsterdam, September 1993.
12. Main M.G. Trace, failure and testing equivalences for communicating processes. International Journal of Parallel Programming. 16:(5):1987;383-400
13. Meyer J.-J.Ch. Merging regular processes by means of fixed-point theory. Theoretical Computer Science. 45:(2):1986;193-260
14. R. Milner. Processes: a mathematical model of computing agents. In H.E. Rose and J.C. Shepherdson, editors, Proceedings of the Logic Colloquium, volume 80 of Studies in Logic and the Foundations of Mathematics, pages 157 - 173, Bristol, July 1973. North-Holland.
15. Milner R. A Calculus of Communicating Systems. volume 92 of Lecture Notes in Computer Science. 1980;Springer-Verlag, Berlin
16. Mislove M.W., Oles F.J. Full abstraction and recursion. Theoretical Computer Science. 151:(1):November1995;207-256
17. D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proceedings of 5th Gl-Conference on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science, pages 167 - 183, Karlsruhe, March 1981. Springer-Verlag.
18. G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University, Aarhus, September 1981.
19. J.J.M.M. Rutten. Correctness and full abstraction of metric semantics for concurrency. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Proceedings of the School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 628 - 659, Noordwijkerhout, May/June 1988. Springer-Verlag.
20. Stoughton A. Fully Abstract Models of Programming Languages. 1988;Research Notes in Theoretical Computer Science. Pitman, London