Modeling and Verification of Reliable Messaging by Graph Transformation Systems

L, Gönczy [Gönczy, László (informatika), author] Department of Measurement and Information Systems (BUTE / FEEI); M, Kovács [Kovács, Máté Amadé (műszaki informatika), author] Department of Measurement and Information Systems (BUTE / FEEI); D, Varró [Varró, Dániel (Informatika, szof...), author] Department of Measurement and Information Systems (BUTE / FEEI)

English Article (Journal Article) Scientific
  • SJR Scopus - Computer Science (miscellaneous): Q2
Identifiers
Subjects:
  • Mathematics
  • Computer and information sciences
Due to the increasing need of highly dependable services in Service-Oriented Architectures (SOA), service-level agreements include more and more frequently such non-functional aspects as security, safety, availability, reliability, etc. Whenever a service can no longer be provided with the required QoS, the service requester needs to switch dynamically to a new service having adequate service parameters after exchanging a sequence of messages. In the current paper, we first extend the core SOA metamodel with parameters required for reliable messaging in services. Then we model reconfigurations for reliable message delivery by graph transformation rules. Finally, we carry out a formal verification of the proposed rule set by combining analysis tools for graph transformation and labeled transition systems.
Citation styles: IEEEACMAPAChicagoHarvardCSLCopyPrint
2023-05-31 22:14