Towards a graph grammar based verification approach for runtime constrained evolution of service-oriented architectures

1Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Service Oriented Architecture(SOA) is a new form of distributed software architecture. It promotes loose coupling, services distribution, dynamicity and agility. Runtime architecture of new generation service based system should be evolutional for flexible application requirement, instability of composing service nodes and Internet environment. Modeling of runtime SOA and verifying consistency of evolution could improve system dependability and adaptability. The main contribution of this paper is a graph grammar based modeling and verification approach for constrained evolution of SOA at runtime. System specification described by SOA style and structural constraints and their satisfaction checking algorithms are proposed. We have implemented an initial constrained evolution verification tool that allow us to model runtime SOA, SOA style and constraints and verify consistency. © 2010 IEEE.

Cite

CITATION STYLE

APA

Zhao, Y., Zhao, B., Liu, M., Hu, C., & Ma, D. (2010). Towards a graph grammar based verification approach for runtime constrained evolution of service-oriented architectures. In Proceedings - 5th IEEE International Symposium on Service-Oriented System Engineering, SOSE 2010 (pp. 159–164). https://doi.org/10.1109/SOSE.2010.12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free