Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation
A graph transformation approach to software architecture reconfiguration
Science of Computer Programming - Special issue on applications of graph transformations (GRATRA 2000)
Model-based Discovery of Web Services
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Basic Concepts and Taxonomy of Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing
Automatic conformance testing of web services
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Model checking dynamic states in GROOVE
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Graph transformation for domain-specific discrete event time simulation
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Scenario-driven analysis of systems specified through graph transformations
Journal of Visual Languages and Computing
Domain-specific discrete event modelling and simulation using graph transformation
Software and Systems Modeling (SoSyM)
GReTL: an extensible, operational, graph-based transformation language
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
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.