Abstract
A process algebra, called M-expressions, based on parameterised (multi-)actions is introduced. In the context of the Petri Box Calculus, it serves as a kind of high level counterpart to Box expressions. An operational semantics based on step sequences, similar to that given by Best, Esparza and Koutny for Box expressions is defined. The consistency and completeness of the semantics is proved with respect to the elementary case. The process algebra is applied as the semantic domain for a concurrent programming language. The consistency and completeness of the operational semantics is proved for this application with respect to an existing high level Petri net semantics.
Supported by the French-German project POEM.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Baeten and W.P. Weijland. Process Algebras. Cambridge Tracts in Theoretical Computer Science 18, 1990.
E. Best, R. Devillers, and J.G. Hall. The Box Calculus: a New Causal Algebra with Multi-Label Communication. In G. Rozenberg, Ed., Advances in Petri Nets 92, Vol. 609 of Lecture Notes in Computer Science, pages 21–69. Springer, 1992.
E. Best, R. Devillers, and M. Koutny. Petri Net Algebra. Book draft, 1997.
E. Best and H. Fleischhack, Eds. PEP: Programming Environment Based on Petri Nets. Number 14/95 in Hildesheimer Informatik-Berichte. Universitiät Hildesheim, May 1995.
E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. In Michelis and Diaz, Eds., Application and Theory of Petri Nets 1995, Vol. 935 of Lecture Notes in Computer Science. Springer, June 1995.
E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. An M-Net Semantics of B(PN) 2. In STRICT, WiC. Springer, 1995.
E. Best and R.P. Hopkins. B(PN)2 — a Basic Petri Net Programming Notation. In A. Bode, M. Reeve, and G. Wolf, Eds., Proceedings of PARLE '93, Vol. 694 of Lecture Notes in Computer Science, pages 379–390. Springer, 1993.
E. Best and M. Koutny. A Refined View of the Box Algebra. In Michelis and Diaz, Eds., Application and Theory of Petri Nets 1995, Vol. 935 of Lecture Notes in Computer Science, pages 1–20. Springer, June 1995.
C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall (1985).
H. Klaudel and R.-C. Riemann. M-expressions — a High Level Process Algebra with an Application to a Parallel Programming Language. LRI, Université Paris-Sud, Rapport 1090, January 1997. (http://www.lri.fr/∼robert/work.html).
M. Koutny, J. Esparza, and E. Best. Operational Semantics for the Petri Box Calculus. In B. Jonsson and J. Parrow, Eds., CONCUR'94: Concurrency Theory, Vol. 836 of Lecture Notes in Computer Science, pages 210–225. Springer, 1994.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
G.D. Plotkin. A Structural Approach to Operational Semantics. Report DAIMI FN-19, Aarhus University, Computer Science Departement, September 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klaudel, H., Riemann, RC. (1997). High level expressions with their SOS semantics. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_20
Download citation
DOI: https://doi.org/10.1007/3-540-63141-0_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63141-5
Online ISBN: 978-3-540-69188-4
eBook Packages: Springer Book Archive