Abstract
We study testing preorders for an asynchronous version of CCS called TACCS, where message emission is non blocking. We first give a labelled transition system semantics for this language, which includes both external and internal choice operators. By applying the standard definitions of may and must testing to this semantics we obtain two behavioural preorders based on asynchronous observations, \(\mathbin{\mathbin{\raisebox{-.65ex}{\raisebox{.97ex}{\(\sqsubset\)} \(\!\!\!\!\!\sim\)}}_{may}}\) and \(\mathbin{\mathbin{\raisebox{-.65ex}{\raisebox{.97ex}{\(\sqsubset\)} \(\!\!\!\!\!\sim\)}}_{must}}\). We present alternative behavioural characterisations of these preorders, which are subsequently used to obtain equational theories for the finite fragment of the language.
Research partially funded by the EU Working Group CONFER II and the EU HCM Network EXPRESS. The second author was also supported by the EPSRC project GR/K60701.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amadio, R., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195, 291–324 (1998)
Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Computer Science, vol. 18 (1990)
Boreale, M., DeNicola, R., Pugliese, R.: Asynchronous observations of processes. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, p. 95. Springer, Heidelberg (1998)
Boreale, M., DeNicola, R., Pugliese, R.: Laws for asynchrony (1998) (Draft)
Boudol, G.: Asynchrony and the π-calculus. Research Report 1702, INRIA, Sophia-Antipolis (1992)
DeNicola, R., Hennessy, M.: Testing equivalences for provesses. Theoretical Computer Science 43, 83–133 (1984)
Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)
Honda, K., Tokoro, M.: On asynchronous communication semantics. In: Tokoro, M., Wegner, P., Nierstrasz, O. (eds.) ECOOP-WS 1991. LNCS, vol. 612, Springer, Heidelberg (1992)
Merro, M., Sangiorgi, D.: On asynchrony in name-passing calculi. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, p. 856. Springer, Heidelberg (1998)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Nestmann, U., Pierce, B.: Decoding choice encodings. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, Springer, Heidelberg (1996)
Pierce, B.C., Turner, D.N.: Pict: A programming language based on the pi-calculus. Technical Report CSCI 476, Computer Science Department, Indiana University (1997); To appear in Plotkin, G., Stirling, C., Tofte, M. (eds.): Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, Cambridge
Selinger, P.: First-order axioms for asynchrony. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castellani, I., Hennessy, M. (1998). Testing Theories for Asynchronous Languages. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-49382-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65384-4
Online ISBN: 978-3-540-49382-2
eBook Packages: Springer Book Archive