A general theory of action languages

Cybernetics and Systems Analysis

Volumn 34, Issue 1, 1998, Pages 12-30

  Letichevsky, Alexander ^a   Gilbert, David ^a  

^a V M GLUSHKOV INSTITUTE OF CYBERNETICS   (Ukraine)

Author keywords

Behavior; Distribution; Environments; Interaction; Semantics

Indexed keywords

EID: 26444604806     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/BF02911258     Document Type: Article

References (31)

1. S. Abramsky, "A domain equation for bisimulation," Inform. Comput., 92(2), 161-218 (1991).
2. S. Abramsky, "Semantics of interaction," in: Trees in Algebra and Programming - CAAP'96, Proc. 21st Int. Coll., Linköping, Lecture Notes in Computer Science, Vol. 1059, Springer-Verlag (1996), p. 1.
3. S. Abramsky and A. Jung, "Domain theory," in: Handbook of Logic in Computer Science, Vol. 3, Clarendon Press (1994), pp. 2-168.
4. A. Arnold, Finite Transition Systems, Masson, Prentice Hall (1994).
5. J. A. Bergstra and J. W. Klop, "Process algebra for synchronous communication," Inform. Control, 60(1/3), 109-137 (1984).
6. J. Bradshaw, Software Agents, AAAI/MIT Press (1997).
7. L. Brim, J-M. Jacquet, D. R. Gilbert, and M. Kǐetínský, "A process algebra for synchronous concurrent constraint programming," in: Michael Hanus and Mario Rodríguez-Artalejo (eds.), Proceedings of ALP96: Fifth International Conference on Algebraic and Logic Programming, September, 1996, pp. 165-178.
8. E. Brinksma, "On the design of extended LOTOS; a specification language for open distributed systems," PhD Thesis, Department of Informatics, University of Twente, Enschede, Netherlands, 1988.
9. F. de Boer and C. Palamidessi, "A fully abstract model for concurrent constraint programming," in: S. Abramsky and T. S. E. Maibaum (eds.), Proc. of TAPSOFT/CAAP91, Lecture Notes in Computer Science, Springor-Veilag (1991), pp. 290-319.
10. V. M. Glushkov. "Automata theory and the design of computers," Kibernetika, no. 1 (1965).
11. V. M. Glushkov and A. A. Letichevsky, "Theory of algorithms and discrete processors," in: Advances in Information Sciences, Vol. 1, Plenum Press (1969), pp. 1-58.
12. J. A. Gognen, J. W. Thatcher, E. G. Wagner, and J. B. Wright. "Initial algebra semantics and continuous algebras." J. ACM, 24(1). 68-95. January. 1977.
13. I. Guessarian, Algebraic Semantics, Lecture Notes in Computer Science, Vol. 99, Springer-Verlag (1981).
14. C. A. Gunter and D. S. Scott, "Semantic domains," in: Handbook of Theoretical Computer Science, Vol. B, MIT Press (1994), pp. 633-674.
15. M. Hennessy, Algebraic Theory of Processes, MIT Press (1988).
16. C. A. R. Hoare, Communicating Sequential Processes, Prentice Hall, UK (1985).
17. ISO. ISO IS 8807 Information Processing Systems, Open Systems Interconnection, LOTOS (1989).
18. A. A. Letichevsky, "Algebras with approximation and recursive data structures," Kibernetika, no. 5, 32-37, September-October, 1987.
19. A. A. Letichevsky and D. R. Gilbert, "Toward an implementation theory of nondeterministic concurrent languages," Technical Report 1996/09, Department of Computer Science, City University, 1996. Also presented at the Second Workshop of the INTAS-93-1702 Project Efficient Symbolic Computing, St. Petersburg, Russia, October, 1996.
20. G. J. Milne, "CIRCAL and the representation of communication, concurrency and time," ACM TOPLAS, 7(2), 270-298, April, 1985.
21. R. Milner, Communication and Concurrency, Prentice Hall (1989).
22. R. Milner, "The polyadic π-calculus: a tutorial," Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, October 1991. Appeared in Proceedings of the International Summer School on Logic and Algebra of Specification, Marktoberdorf, August 1991. Reprinted in Logic and Algebra of Specification, F. L. Bauer, W. Brauer, and H. Schwichtenberg (eds.), Springer-Verlag (1993).
23. R. Milner, "Action calculi, or syntactic action structures," in: Andrzej M. Borzyszkowski and Stefan Sokolowski (eds.), Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Lecture Notes in Computer Science, Vol. 711, Springer (1993), pp. 105-121.
24. R. Milner, "Elements of interaction," Communications of the ACM, 36(1), 78-89 (1993). Turing Award Lecture.
25. G. Plotkin, "A structured approach to operational semantics," Technical Report, Tech. Rep. DAIMI FN-19, Computer Science Dept., Aarhus University, 1981.
26. F. Rossi and U. Montanari, "Concurrent semantics for concurrent constraint programming," in: B. Mayoh," E. Tyugu, and J. Penjaam (eds.), Constraint Programming: Proceedings 1993 NATO ASI Parnu, Estonia, NATO Advanced Science, Institute Series, Springer-Verlag (1994), pp. 181-220.
27. V. Saraswat, Concurrent Constraint Programming, MIT Press (1993).
28. C. Stirling, "Decidability of bisimulation equivalence for normed pushdown processes," in: CONCUR96, LNCS 1119 (1996), pp. 217-232.
29. Peter van Eijk, C. A. Vissers, and M. Diaz (eds.), The Formal Description Technique LOTOS, North-Holland (1989).
30. P. Wegner, "Interaction as a basis for empirical computer science," ACM Comput. Surv., 27(1), 45-48, March, 1995.
31. P. Wegner, "Why interaction is more powerful than algorithms," CACM, 40(5), 80-91 (1997).