Abstract
Sequential programs under execution produce behaviours to be controlled by some execution environment. Threads as considered in basic thread algebra model such behaviours: upon each action performed by a thread, a reply from an execution environment – which takes the action as an instruction to be processed – determines how the thread proceeds. In this paper, we are concerned with the case where the execution environment is remote: we study some transmission protocols for passing instructions from a thread to a remote execution environment.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bergstra, J.A., Loots, M.E.: Program algebra for sequential code. Journal of Logic and Algebraic Programming 51(2), 125–156 (2002)
Bergstra, J.A., Bethke, I., Ponse, A.: Decision problems for pushdown threads. Acta Informatica 44(2), 75–90 (2007)
Bergstra, J.A., Middelburg, C.A.: Program algebra with a jump-shift instruction. Journal of Applied Logic 6(4), 553–563 (2008)
Ponse, A., van der Zwaag, M.B.: An introduction to program and thread algebra. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 445–458. Springer, Heidelberg (2006)
Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control 60(1–3), 109–137 (1984)
Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, Cambridge (1990)
Hennessy, M., Milner, R.: Algebraic laws for non-determinism and concurrency. Journal of the ACM 32(1), 137–161 (1985)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM 31(3), 560–599 (1984)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Bergstra, J.A., Middelburg, C.A.: Thread algebra with multi-level strategies. Fundamenta Informaticae 71(2–3), 153–182 (2006)
Bergstra, J.A., Bethke, I.: Polarized process algebra and program equivalence. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1–21. Springer, Heidelberg (2003)
Fokkink, W.J.: Introduction to Process Algebra. Texts in Theoretical Computer Science, An EATCS Series. Springer, Berlin (2000)
Baeten, J.C.M., Bergstra, J.A.: On sequential composition, action prefixes and process prefix. Formal Aspects of Computing 6(3), 250–268 (1994)
Baeten, J.C.M., Bergstra, J.A.: Discrete time process algebra. Formal Aspects of Computing 8(2), 188–208 (1996)
Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. Monographs in Theoretical Computer Science, An EATCS Series. Springer, Berlin (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergstra, J.A., Middelburg, C.A. (2009). Transmission Protocols for Instruction Streams. In: Leucker, M., Morgan, C. (eds) Theoretical Aspects of Computing - ICTAC 2009. ICTAC 2009. Lecture Notes in Computer Science, vol 5684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03466-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-03466-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03465-7
Online ISBN: 978-3-642-03466-4
eBook Packages: Computer ScienceComputer Science (R0)