Abstract
Specification Diagrams (SD) [19] are a graphical notation for specifying the message passing behavior of open distributed object systems. SDs facilitate specification of system behaviors at various levels of abstraction, ranging from high-level specifications to concrete diagrams with low-level implementation details. We investigate the theory of may testing equivalence [15] on SDs, which is a notion of process equivalence that is useful for relating diagrams at different levels of abstraction. We present a semantic characterization of the may equivalence on SDs which provides a powerful technique to relate abstract specifications and refined implementations. We also describe our prototypical implementation of SDs and of a procedure that exploits the characterization of may testing to establish equivalences between finitary diagrams (without recursion).
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
Agha, G.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge (1986)
Boreale, M., De Nicola, R., Pugliese, R.: Trace and testing equivalence on asynchronous processes. Information and Computation 172(2), 139–164 (2002)
Boudol, G.: Asynchrony and the π-Calculus. Technical Report 1702, INRIA Technical Report (May 1992)
Castellani, I., Hennessy, M.: Testing theories for asynchronous languages. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 90–101. Springer, Heidelberg (1998)
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Towards Maude 2.0. In: International Workshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 297–318 (2000)
de Bruijn, N.G.: Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Proc. Kninkl. Nederl. Akademie van Wetenschappen 75, 381–392 (1972)
Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, Heidelberg (1990)
Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)
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)
Ingolfsdottir, A., Lin, H.: A symbolic approach to value passing processes. In: Handbook of Process Algebra, pp. 427–478. Elsevier Publishing, Amsterdam (2001)
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)
Meseguer, J.: Rewriting as a unified model of concurrency. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 384–400. Springer, Heidelberg (1990)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (Parts I and II). Information and Computation 100, 1–77 (1992)
De Nicola, R., Hennessy, M.: Testing equivalence for processes. Theoretical Computer Science 34, 83–133 (1984)
Plotkin, G.D.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Dept., Aarhus University (September 1981)
ITU-T Recommendation Z.120. Message sequence charts (1996)
Rumbaugh, J., Jacobson, I., Booch, G.: Unified Modeling Language Reference Manual. Addison-Wesely, Reading (1998)
Smith, S., Talcott, C.: Modular reasoning for actor specification diagrams. In: Formal Methods in Object-Oriented Distributed Systems, Kluwer Academic Publishers, Dordrecht (1999)
Smith, S., Talcott, C.: Specification diagrams for actor systems. In: Higher-Order and Symbolic Computation (2002) (to appear)
Stehr, M.O.: CINNI — A generic calculus of explicit substitutions and its application to λ-, ς- and π-calculi. In: International Workshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 71–92 (2000)
Thati, P., Sen, K., Martí-Oliet, N.: An executable specification of asynchronous π-calculus and may testing in Maude 2.0. In: International Workshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, vol. 71 (2002)
Thati, P., Ziaei, R., Agha, G.: A theory of may testing for actors. In: Formal Methods for Open Object-based Distributed Systems (March 2002)
Thati, P., Ziaei, R., Agha, G.: A theory of may testing for asynchronous calculi with locality and no name matching. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, pp. 222–238. Springer, Heidelberg (2002)
Verdejo, A.: Building tools for lotos symbolic semantics in maude. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 292–307. Springer, Heidelberg (2002)
Verdejo, A., Martí-Oliet, N.: Implementing CCS in Maude 2. In: International Conference on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, vol. 71 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thati, P., Talcott, C., Agha, G. (2004). Techniques for Executing and Reasoning about Specification Diagrams. In: Rattray, C., Maharaj, S., Shankland, C. (eds) Algebraic Methodology and Software Technology. AMAST 2004. Lecture Notes in Computer Science, vol 3116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27815-3_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-27815-3_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22381-8
Online ISBN: 978-3-540-27815-3
eBook Packages: Springer Book Archive