zbMATH — the first resource for mathematics

Coordinating action systems. (English) Zbl 0959.68006
Summary: We develop an action systems-based approach that supports the separation of the design of the functional or computation aspects of a system under construction from the coordination and synchronization issues. The computation aspects are modeled as nondeterministic actions that work in parallel with the coordination actions, which impose some control on the nondeterministic part. We define a special form of action systems that models this type of coordination activity. Certain forms of real-time scheduling and coordination as well as exception handling are shown to be special cases of our approach. We show how the coordinators can be stepwise brought about from a high-level specification of the target system and how the reasoning about their behaviors is carried out separately from the computation aspects of the system within the refinement calculus.
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
Full Text: DOI
[1] Agha, G., Actorsa model of concurrent computation in distributed systems, (1986), MIT Press Los Alamos, CA
[2] Arbab, F.; Ciancarini, P.; Hankin, C., The IWIM model for coordination of concurrent activities, Coordination’96coordination languages and models, lecture notes in computer science, 1061, (1996), Springer Berlin
[3] R.J.R. Back, On the correctness of refinement steps in program development, Ph.D. Thesis, Department of Computer Science, University of Helsinki, Helsinki, Finland, 1978. Report A-1978-4.
[4] R.J.R. Back, R. Kurki-Suonio, Decentralization of process nets with centralized control, Proc. of the 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, 1983, pp. 131-142.
[5] Back, R.J.R.; Sere, K., Stepwise refinement of action systems, Struct. programming, 12, 17-30, (1991)
[6] Back, R.J.R.; Sere, K., From modular systems to action systems, Software – concepts tools, 17, 26-39, (1996) · Zbl 0852.68008
[7] Back, R.J.R.; von Wright, J., Trace refinement of action systems, (), 367-384 · Zbl 1093.68007
[8] Banâtre, J.-P.; Le Métayer, D., Programming by multiset transformation, Comm. ACM, 36, 1, 98-111, (1993)
[9] Bonsangue, M.M.; Kok, J.N., The weakest precondition calculusrecursion and duality, Formal aspects comput., 6, A, 788-800, (1994) · Zbl 0816.68081
[10] M.M. Bonsangue, J. N. Kok, K. Sere, An approach to object-orientation in action systems, in: Mathematics of Program Construction (MPC’98), Marstrand, Sweden, June 1998. Lecture Notes in Computer Science, vol. 1422, Springer, Berlin.
[11] Carriero, N.; Gelernter, D., Coordination languages and their significance, Comm. ACM, 35, 2, 97-107, (1982)
[12] Chandy, K.; Misra, J., Parallel program designa foundation, (1988), Addison-Wesley Reading, MA · Zbl 0717.68034
[13] Chaudron, M.; de Jong, E., Towards a compositional method for coordinating gamma programs, ()
[14] ()
[15] Cunningham, H.C.; Roman, G.C., A \scunity-style programming logic for a shared dataspace language, IEEE trans. parallel distributed systems, 1, 3, 365-376, (1990)
[16] Dijkstra, E.W., A discipline of programming., (1976), Prentice-Hall Englewood Cliffs, NJ · Zbl 0286.00013
[17] ()
[18] Goeman, H.J.M.; Kok, J.N.; Sere, K.; Udink, R.T., Coordination in the imp\scunity framework, Sci. compu. programming, 31, 2, 313-334, (1998) · Zbl 0943.68114
[19] H.J.M. Goeman, J.N. Kok, K. Sere, R.T. Udink, Coordination in the ImpUnity Framework, in: P. Ciancarini, C. Hankin (eds.), Coordination’96: Coordination Languages and Models, Lecture Notes in Computer Science, vol. 1061, Springer, Berlin, 1996.An extended version appeared as TUCS Technical Report No 50, October 1996. Turku, Finland. · Zbl 0943.68114
[20] P.J. McCann, G.-C. Roman, Compositional programming abstractions for mobile computing. IEEE Trans. Software Engin. 24(2) (1998) 97-110.
[21] Morgan, C.C., The specification statement, ACM trans. programming languages systems, 10, 3, 403-419, (1988) · Zbl 0825.68302
[22] Morris, J.M., A theoretical basis for stepwise refinement and the programming calculus, Sci. comput. programming, 9, 287-306, (1987) · Zbl 0624.68017
[23] Nelson, G., A generalization of Dijkstra’s calculus, ACM toplas, 11, 4, 517-561, (1989)
[24] S. Ren, G. Agha, A modular approach for programming distributed real-time systems, Hand-Out, European Educational Forum, School on Embedded Systems, Veldhoven, NL, November 1996.
[25] Sekerinski, E.; Sere, K., A theory of prioritizing composition, Comput. J, 39, 8, 701-712, (1986)
[26] Sere, K.; Waldén, M.; Abadi, M.; Ito, T., Data refinement of remote procedures, Theoretical aspects of computer software, lecture notes in computer science, 1281, (1997), Springer Berlin
[27] Sha, L.; Rajkumar, R.; Lehoczky, J.P., Priority inheritance protocolsan approach to real-time synchronization, IEEE trans. comput., 39, 9, 1175-1185, (1990) · Zbl 1395.90151
[28] Udink, R.T.; Kok, J.N., Imp\scunity: \scunity with procedures and local variables, () · Zbl 0783.68082
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.