Located Actions in Process Algebra with Timing

• Autorzy: Bergstra J.A. , Middelburg C.A.
• Języki publikacji: EN

Abstrakty

EN

We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially located actions. This process algebra makes it possible to deal with the behaviour of systems with a known time-dependent spatial distribution, such as protocols transmitting data via a mobile intermediate station. It is a reformulation of the real space process algebra from Baeten and Bergstra [Formal Aspects of Computing, 5, 1993, 481-529] in a setting with urgent actions. This leads to many simplifications.

Słowa kluczowe

EN

process algebras; continuous relative timing; spatially located actions; distributed systems; state operator; maximal progress; asynchronous communication; urgent actions

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2004
• Tom: Vol. 61, nr 3,4
• Strony: 183--211
• Opis fizyczny: Biblogr. 24 poz., tab.,

Twórcy

autor

Bergstra J.A.

• Programming Research Group University of Amsterdam, Amsterdam, the Netherlands

autor

Middelburg C.A.

• Computing Science Department, Eindhoven University of Technology, Eindhoven, the Netherlands

Bibliografia

• [1] Aceto. L., Fokkink, W. J., Verhoef, C: Structural Operational Semantics, in: Handbook of Process Algebra (J. A. Bergstra. A. Ponse, S. A. Smolka, Eds.). Elsevier, Amsterdam, 2001. 197-292.
• [2] Baeten, J. C, M., Bergstru, J. A.: Real Time Process Algebra, Formal Aspects of Computing, 3(2), 1991, 142-188.
• [3] Baeten. J. C. M., Bergstra, J. A.: Real Space Process Algebra. Formal Aspects of Computing. 5(6), 1993, 481-529.
• [4] Baeten, J. C. M., Bergstra, J. A., Reniers, M. A.: Discrete Time Process Algebra with Silent Step, in: Proof. Language und Interaction: Essays in Honour of Robin Milner (G. D. Plotkin. C. Stirling. M. Tofte. Eds.). MIT Press. Cambridge, MA, 2000,535-569.
• [5] Baeten. J. C. M., Middelburg, C. A.: Process Algebra with Timing: Real Time and Discrete Time, in: Handbook of Process Algebra (J. A. Bergstra, A. Ponse, S. A. Smolka. Eds.). Elsevier. Amsterdam, 2001, 627-684.
• [6] Baeten. J. C. M., Middelburg. C. A.: Process Algebra with Timing, Monographs in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin. 2002.
• [7] Baeten, J. C. M., Middelburg, C. A., Reniers. M. A.: A New Equivalence for Processes with Timing – With an Application to Protocol Verification. Computer Science Report 02-10. Department of Mathematics and Computer Science. Eindhoven University of Technology, October 2(X)2.
• [8] Baeten, J. C. M., Weijiand, W. P.: Process Algebra, vol. 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press. Cambridge. 1990.
• [9] Bergstra. J. A., Klop. J. W.: Process Algebra for Synchronous Communication, Information and Control, 60(1/3). 1984,109-137.
• [10] Bergstra. J. A., Kiop, J. W.: Verification of an Alternating Bit Protocol by Means of Process Algebra, Mathematical Methods of Specification and Synthesis of Software Systems (W. Bibel. K. P. Jantke, Eds.), 215, Springer-Verlag, 1986.
• [11] Bergstra, J. A., Middelburg, C. A.: Process Algebra for Hybrid Systems, Computer Science Report 03-06. Department of Mathematics and Computer Science., Eindboven University of Technology, June 2003.
• [12] Chen. L.: An Interleaving Model for Real-Time Systems, Symposium on Logical Foundations of Computer Science (A. Nerode, M. Taitslin, Eds.), 620. Springer-Verlag, 1992.
• [13] Davies, J., et al: Timed CSP: Theory and Practice. Real Time: Theory and Practice (J. W. de Bakker, C, Huizing, W. P. de Roever, G. Rozenberg. Eds.), 600, Springer-Verlag, 1992.
• [14] Hennessy. M., Regan, T: A Process Algebra for Timed Systems. Information and Computation, 117, 1995, 221-239.
• [15] Middelburg, C. A.: Variable Binding Operators in Transition System Specifications. Journal of Logic and Algebraic Programming. 47(1). 2001.
• [16] Middelburg, C. A.: Process Algebra with Nonstandard Timing, Fundamenta Informaticae, 53(1). 2002, 55-77.
• [17] Middelburg. C. A.: An Alternative Formulation of Operational Conservativity with Binding Terms, Journal of Logic and Algebraic Programming, 55(1/2), 2003, 1-19.
• [18] Middelburg. C. A.: Revisiting Timing in Process Algebra, Journal of Logic and Algebraic Programming, 54(1/2), 2003, 109-127.
• [19] Moller, F, Tofts, C: A Temporal Calculus of Communicating Systems, CONCUR'90 (J. C. M. Baeten, J. W. Klop, Eds.), 458, Springer-Verlag, 1990.
• [20] Nicollin, X., Sifakis. J.: The Algebra of Timed Processes ATP: Theory and Application, Information and Computation, 114(1), 1994. 131-178.
• [21] Quemada, J., de Frutos, D., Azcorra, A.: TIC: A Timed Calculus, Formal Aspects of Computing. 5(3), 1993, 224-252.
• [22] Tanenbaum. A. S.; Computer Networks, Prentice-Hall, Englewood Cliffs, 1981.
• [23] Verhoef. C: A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises. Nordic Journal of Computing, 2{2), 1995,274-302.
• [24] Wang Yi: Real-Time Behaviour of Asynchronous Agents. CONCUR’90 (J. C. M. Baeten, J. W. Klop, Eds.), 458, Springer-Verlag, 1990.