Abstract
We study the extension of a simple process algebra with the delayed choice operator. It differs from the normal non-deterministic choice in that the moment of choice is delayed until all alternatives can be distinguished by their first action. An application is in joining Message Sequence Charts.
This research was supported in part by ESPRIT basic research action 7166, CONCUR2.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Aceto, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. Information and Computation, 111(1):1–52 1994.
J.C.M. Baeten and J.A. Bergstra. Process algebra with partial choice. In B. Jonsson and J. Parrow, editors, Proc. CONCUR ‘84, pages 465–480. Uppsala, Springer Verlag, 1994. LNCS 836.
J.C.M. Baden, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fund. Inf., IX(2):127–168, 1986.
J.C.M. Baeten and R.J. van Glabbeek. Merge and termination in process algebra. In K.V. Nori, editor, Proc. FSThITCS 7, pages 153–172. Pune, Springer Verlag, 1987. LNCS 287.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. IAndC, 60 (1/3): 109–137, 1984.
B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can’t be traced: preliminary report. In Proc. 15th ACM symposium on Principles of Programming Languages, pages 229–239. San Diego, California, 1988.
S.D. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. Journal of the ACM 31:560–599, 19F84.
P. D’Argenio. 7-angelic choice for process algebra. Technical report, LIFIA, Dpto. de Informà tica, Fac. Cs. Exactas, UNLP, 1994.
J. de Man. Towards a formal semantics of Message Sequence Charts. In
O. Færgemand and A. Sarma, editors, SDL’93 Using Objects, Proceedings of the Sixth SDL Forum, Darmstadt, 1993. Elsevier Science Publishers B.V.
J. Engelfriet. Determinacy -> (observation equivalence = trace equivalence. TCS, 36 (1): 21–25, 1985.
O. Haugen. MSC Structural concepts. Experts Meeting SG10, Turin, TD9006, ITU-TS, 1994.
ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva, 1994.
S. Kamin and J.-J. Lévy. Two generalizations of the recursive path ordering. Unpublished manuscript, 1980.
J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume II, pages 1–116. Oxford University Press, 1992.
S. Mauw and M.A. Reniers. An algebraic semantics of Basic Message Sequence Charts. The computer journal, 37 (4): 269–277, 1994.
S. Mauw and M.A. Reniers. An algebraic semantics of Message Sequence Charts. Experts Meeting SG10, Turin, TD9009, ITU-TS, 1994. Report CSN94/23, Eindhoven University of Technology, 1994.
M.W. Mislove and F.J. Oles. A simple language supporting angelic nondeterminism and parallel composition. In S. Brookes, M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Semantics, 7th international conference, pages 77–101. Springer Verlag, 1991. LNCS 598.
G.D. Plotkin. An operational semantics for CSP. In Proceedings of the Conference on the Formal Description of Programming Concepts, volume 2, Garmisch, 1983.
C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. In B. Jonsson and J. Parrow, editors, Proc. CONCUR ‘84, pages 433–448. Uppsala, Springer Verlag, 1994. LNCS 836.
C. Verhoef. A general conservative extension theorem in process algebra. In Proc. PROCOMET’94, IFIP 2 Working Conference. San Miniato, North-Holland, 1994. (to appear), report CSN 93/38, Eindhoven University of Technology 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Baeten, J.C.M., Mauw, S. (1995). Delayed choice: an operator for joining Message Sequence Charts. In: Hogrefe, D., Leue, S. (eds) Formal Description Techniques VII. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34878-0_27
Download citation
DOI: https://doi.org/10.1007/978-0-387-34878-0_27
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2881-0
Online ISBN: 978-0-387-34878-0
eBook Packages: Springer Book Archive