Abstract
We use History Dependent Automata (HD-Automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing.
Informally speaking, service requests are modelled as pairs of HD-Automata \(\langle{C_o,C_r}\rangle\); C r describes the (abstract) behaviour of the searched service and C o the (abstract) behaviour guaranteed by the invoker. Symmetrically, service publication consists of a pair of HD-Automata \(\langle{S_o,S_r}\rangle\) such that S o provides an (abstraction of) of the behaviour guaranteed by the service and S r yields the requirement imposed to invokers. An invocation \(\langle{C_o,C_r}\rangle\) matches a published interface \(\langle{S_o,S_r}\rangle\) when C o simulates S r and S o simulates C r .
Research partially supported by the EU FP6-IST IP 16004 SEnSOria and by the UK project HiDeA4SOC.
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
Bouali, A., Gnesi, S., Larosa, S.: The Integration Project for the JACK Environment. Bulletin of the EATCS 54, 207–223 (1994)
Ciancia, V., Montanari, U.: A name abstraction functor for named sets. In: Coalgebraic Methods in Computer Science 2008 (to appear, 2008)
Ferrari, G.L., Montanari, U., Tuosto, E.: Coalgebraic minimization of hd-automata for the pi-calculus using polymorphic types. Theoretical Computer Science 331(2-3), 325–365 (2005)
Ferrari, G., Ferro, G., Gnesi, S., Montanari, U., Pistore, M., Ristori, G.: An Automata Based Verification Environment for Mobile Processes. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 275–289. Springer, Heidelberg (1997)
Ferrari, G., Gnesi, S., Montanari, U., Pistore, M.: A Model Checking Verification Environment for Mobile Processes. ACM Transactions on Software Engineering and Methodology 12(4), 440–473 (2003)
Ferrari, G., Montanari, U., Pistore, M.: Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 129–143. Springer, Heidelberg (2002)
Ferrari, G., Montanari, U., Tuosto, E.: From Co-algebraic Specifications to Implementation: The Mihda toolkit. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol. 2852, pp. 319–338. Springer, Heidelberg (2003)
Ferrari, G., Montanari, U., Tuosto, E.: Coalgebraic Minimisation of HD-automata for the π-Calculus in a Polymorphic λ-Calculus. Theoretical Computer Science 331, 325–365 (2005)
Ferrari, G., Montanari, U., Tuosto, E., Victor, B., Yemane, K.: Modelling and Minimising the Fusion Calculus Using HD-Automata. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 142–156. Springer, Heidelberg (2005)
Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13(3-5), 341–363 (2002)
Gadducci, F., Miculan, M., Montanari, U.: About permutation algebras (pre)sheaves and named sets. Higher-Order and Symbolic Computation 19(2-3), 283–304 (2006)
Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I and II. Information and Computation 100(1), 1–40,41–77 (1992)
Montanari, U., Buscemi, M.: A First Order Coalgebraic Model of π-Calculus Early Observational Equivalence. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 449–465. Springer, Heidelberg (2002)
Montanari, U., Pistore, M.: Checking Bisimilarity for Finitary π-Calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 42–56. Springer, Heidelberg (1995)
Montanari, U., Pistore, M.: History Dependent Automata. Technical report, Dipartimento di Informatica, Università di Pisa, TR-11-98 (1998)
Montanari, U., Pistore, M.: π-Calculus, Structured Coalgebras, and Minimal HD-Automata. In: Leung, K.-S., Chan, L., Meng, H. (eds.) IDEAL 2000. LNCS, vol. 1983, Springer, Heidelberg (2000); An extended version will be published on Theoretical Computer Science
Montanari, U., Pistore, M.: Structured coalgebras and minimal hd-automata for the π-calculus. Theoretical Computer Science 340, 539–576 (2005)
Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM Journal on Computing 16(6), 973–989 (1987)
Parrow, J., Victor, B.: The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. In: Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (1998)
Pistore, M.: History Dependent Automata. PhD thesis, Università di Pisa, Dipartimento di Informatica, available at University of Pisa as PhD Thesis TD-5/99 (1999)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)
Sangiorgi, D., Walker, D.: The π-Calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ciancia, V., Ferrari, GL., Pistore, M., Tuosto, E. (2008). History Dependent Automata for Service Compatibility. In: Degano, P., De Nicola, R., Meseguer, J. (eds) Concurrency, Graphs and Models. Lecture Notes in Computer Science, vol 5065. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68679-8_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-68679-8_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68676-7
Online ISBN: 978-3-540-68679-8
eBook Packages: Computer ScienceComputer Science (R0)