Abstract
Process algebra provides essential tools for studying concurrent systems. An important branch of process algebra is value passing CCS. However, value passing CCS lacks not only action refinement, which is an essential operation in the design of concurrent systems, but also non-interleaving semantics, which is appropriate to specify the partial order and equivalence relations. In this paper, we will define action refinement and non-interleaving semantics by valued stable event structures and valued labeled configuration structures in which special valued actions will be executed. The refinement operation and semantics are useful for the hierarchical design methodology in value passing CCS, e.g. top-down system design.
This work was supported by the National Natural Science Foundation of China (No. 90612016 and 60473095).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ingólfsdóttir, A., Lin, H.: A symbolic Approach to value passing Processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 427–478. Elsevier, Amsterdam (2001)
Bossi, A., Piazza, C., Rossi, S.: Preserving (Security) Properties under Action Refinement. In: CILC 2004, Parma (June 2004)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International, Englewood Cliffs (1985)
Bolton, C., Davies, J., Woodcock, J.: On the Refinement and Simulation of Data Types and Processes. In: IFM 1999. Proceedings of the 1st International Conference on Integrated Formal Methods, pp. 273–292. Springer, Heidelberg (1999)
Fecher, H., Majster-Cederbaum, M., Wu, J.: Action refinement for probabilistic processes with true concurrency models. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, pp. 77–94. Springer, Heidelberg (2002)
Fecher, H., Majster-Cederbaum, M., Wu, J.: Refinement of actions in a real-time process algebra with a true concurrency model. Electronic Notes in Theoretical computer Science 70(3) (2002)
Goltz, U., Gorrieri, R., Rensink, A.: Techinical Report UBLCS-99-09, University of Bologna, 1999. In: Handbook of Process Algebra, ch. XVI, pp. 1047–1147. Elsevier Science, Amsterdam (2001)
Bergstra, J.A., Klop, J.W.: Algebra of Communitating Processes with Abstraction. TCS 37(1), 77–121 (1985)
Katoen, J.P.: Concepts, Algorithms and Tools for Model Checking. Friedrich-Alexander Universität Erlangen-Nürnberg (1999)
Katoen, J.P.: Quantitative and qualitative extensions of event structures, PhD thesis, University of Twente (1996)
Rathke, J., Hennessy, M.: Local Model Checking for value passing Processes (Extended Abstract). In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol. 1281, Springer, Heidelberg (1997)
Fecher, H.: Event Structures for Interrupt Process Algebras. In: EXPRESS 2003. Electronic Notes in Theoretical Computer Science, vol. 96, pp. 113–127. Elsevier Science Publishers, Amsterdam (2004)
Aceto, L.: Action-refinement in Process Algebra. Cambridge Univ. Press, Cambridge (1992)
Aceto, L., Hennessy, M.: Adding action refinement to a finite process algebra. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) Automata, Languages and Programming. LNCS, vol. 510, pp. 506–519. Springer, Heidelberg (1991)
Aceto, L., Hennessy, M.: Towards action refinement in process algebras. Information and Computation 103(2), 204–269 (1993)
Aceto, L., Hennessy, M.: Adding action refinement to a finite process algebra. Information and Computation 115(2), 179–247 (1994)
Hennessy, M., Lin, H.: Proof systems for message-passing process algebras. In: Formal Aspects of Computing, vol. 8, pp. 379–407. Springer, London (1996)
Majster-Cederbaum, M., Wu, J.: Adding action refinement to stochastic true concurrency models. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol. 2885, pp. 226–245. Springer, Heidelberg (2003)
Majster-Cederbaum, M., Wu, J.: Action refinement for true concurrent real time. In: Proc. ICECCS 2001, pp. 58–68. IEEE Computer Society Press, Los Alamitos (2001)
Majster-Cederbaum, M., Wu, J.: Towards action refinement for true concurrent real time. Acta Informatica 39, 531–577 (2003)
van Glabbeek, R., Vaandrager, F.: Bundle Event Structures and CCSP. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 57–71. Springer, Heidelberg (2003)
van Glabbeek, R., Goltz, U.: Refinement of Actions in Causality Based models. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Stepwise Refinement of Distributed Systems. LNCS, vol. 430, pp. 267–300. Springer, Heidelberg (1990)
van Glabbeek, R., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37, 29–327 (2001)
Gorrieri, R., Rensink, A.: Action Refinement. In: Handbook of Process Algebra (2001)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Deng, W., Lin, H.: Extended Symbolic Transition Graphs with Assignment. In: Proceedings of the 29th Annual International Computer Software and Applications Conference (COMPSAC 2005), vol. 1 (July 2005)
Wirth, N.: Program Development by Stepwise Refinement. Communications of ACM 14(4), 221–227 (1971)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, G., Li, S., Wu, J., Li, L. (2007). A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement. In: Preparata, F.P., Fang, Q. (eds) Frontiers in Algorithmics. FAW 2007. Lecture Notes in Computer Science, vol 4613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73814-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-73814-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73813-8
Online ISBN: 978-3-540-73814-5
eBook Packages: Computer ScienceComputer Science (R0)