Modeling and Verification of Reliable Messaging by Graph Transformation Systems

László Gönczy, Máté Kovács, D. Varró

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)37-50
Number of pages14
JournalElectronic Notes in Theoretical Computer Science
Volume175
Issue number4 SPEC. ISS.
DOIs
Publication statusPublished - Jul 9 2007

Fingerprint

Graph Transformation
Service oriented architecture (SOA)
Modeling
Quality of service
Switches
Availability
Service-oriented Architecture
Labeled Transition System
Service Level Agreement
Formal Verification
Reconfiguration
Metamodel
Switch
Safety
Formal verification

Keywords

  • Graph Transformation
  • Reliable Messaging
  • Service Oriented Architecture

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Modeling and Verification of Reliable Messaging by Graph Transformation Systems. / Gönczy, László; Kovács, Máté; Varró, D.

In: Electronic Notes in Theoretical Computer Science, Vol. 175, No. 4 SPEC. ISS., 09.07.2007, p. 37-50.

Research output: Contribution to journalArticle

@article{0159c15a4cf24c3f923b04d5f67de446,
title = "Modeling and Verification of Reliable Messaging by Graph Transformation Systems",
abstract = "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.",
keywords = "Graph Transformation, Reliable Messaging, Service Oriented Architecture",
author = "L{\'a}szl{\'o} G{\"o}nczy and M{\'a}t{\'e} Kov{\'a}cs and D. Varr{\'o}",
year = "2007",
month = "7",
day = "9",
doi = "10.1016/j.entcs.2007.04.015",
language = "English",
volume = "175",
pages = "37--50",
journal = "Electronic Notes in Theoretical Computer Science",
issn = "1571-0661",
publisher = "Elsevier",
number = "4 SPEC. ISS.",

}

TY - JOUR

T1 - Modeling and Verification of Reliable Messaging by Graph Transformation Systems

AU - Gönczy, László

AU - Kovács, Máté

AU - Varró, D.

PY - 2007/7/9

Y1 - 2007/7/9

N2 - 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.

AB - 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.

KW - Graph Transformation

KW - Reliable Messaging

KW - Service Oriented Architecture

UR - http://www.scopus.com/inward/record.url?scp=34250898527&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250898527&partnerID=8YFLogxK

U2 - 10.1016/j.entcs.2007.04.015

DO - 10.1016/j.entcs.2007.04.015

M3 - Article

AN - SCOPUS:34250898527

VL - 175

SP - 37

EP - 50

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

IS - 4 SPEC. ISS.

ER -