Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10329473 | Electronic Notes in Theoretical Computer Science | 2005 | 12 Pages |
Abstract
Policies are used to control the behavior of large-scale systems. After policies are designed and before policies are implemented, it should be possible to analyze the policies and verify that they behave as expected. Graph transformations provide a good method to carry out the analysis and verification because of the intuitive representation of policies and the mature theory. Here, we show how graph transformations can simulate PONDER policies and use the graph tools AGG and GROOVE to do the static and dynamic analysis.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Francesco Parisi-Presicce, Yujie Zhao,