A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Distributed Feature Composition: A Virtual Architecture for Telecommunications Services
IEEE Transactions on Software Engineering
A Static Analysis Technique for Graph Transformation Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Tutorial Introduction to Graph Transformation: A Software Engineering Perspective
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Address translation in telecommunication features
ACM Transactions on Software Engineering and Methodology (TOSEM)
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Symbolic invariant verification for systems with dynamic structural adaptation
Proceedings of the 28th international conference on Software engineering
Requirements for routing in the application layer
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Weakest preconditions for high-level programs
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Formal modeling of communication protocols by graph transformation
FM'06 Proceedings of the 14th international conference on Formal Methods
Model checking dynamic states in GROOVE
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Symmetry for the analysis of dynamic systems
NFM'11 Proceedings of the Third international conference on NASA Formal methods
| Hi-index | 0.00 |
A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model the dynamic behaviour of a telecommunication system. In this paper, we show how GTS modeling can facilitate verification of invariant properties of potentially infinite-state communication systems. We take as a case study for this approach an invariant property of telecommunication service components that can act both as the source and the target of a connection. Verifying an ordering among service components to be invariant is essential to guarantee the desirable behaviour of these services. We show how the verification can be performed by the analysis of a finite set of transformation rules describing the GTS system model. We prove that invariant properties are preserved in a GTS model if the set of transformation rules describing the model satisfies the property. Thus, we show how to perform system verification through analysis of the model description without building the full system state space.