A Port Graph Calculus for Autonomic Computing and Invariant Verification Export

@article{citeulike:6051822, abstract = {From our previous work on biochemical applications, the structure of port graph (or multigraph with ports) and a rewriting calculus have proved to be well-suited formalisms for modeling interactions between proteins. Then port graphs have been proposed as a formal model for distributed resources and grid infrastructures, where each resource is modeled by a node with ports. The lack of global information and the autonomous and distributed behavior of components are modeled by a multiset of port graphs and rewrite rules which are applied locally, concurrently, and non-deterministically. Some computations take place wherever it is possible and in parallel, while others may be controlled by strategies. In this paper, we first introduce port graphs as graphs with multiple edges and loops, with nodes having explicit connection points, called ports, and edges attaching to ports of nodes. We then define an abstract biochemical calculus that instantiates to a rewrite calculus on these graphs. Rules and strategies are themselves port graphs, i.e. first-class objects of the calculus. As a consequence, they can be rewritten as well, and rules can create new rules, providing a way of modeling adaptive systems. This approach also provides a formal framework to reason about computations and to verify useful properties. We show how structural properties of a modeled system can be expressed as strategies and checked for satisfiability at each step of the computation. This provides a way to ensure invariant properties of a system. This work is a contribution to the formal specification and verification of adaptive systems and to theoretical foundations of autonomic computing.}, author = {Andrei, Oana and Kirchner, H\'{e}l\`{e}ne}, citeulike-article-id = {6051822}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.entcs.2009.10.015}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S1571066109004356}, day = {06}, doi = {10.1016/j.entcs.2009.10.015}, issn = {15710661}, journal = {Electronic Notes in Theoretical Computer Science}, month = {November}, number = {4}, pages = {17--38}, posted-at = {2009-10-31 21:51:56}, title = {A Port Graph Calculus for Autonomic Computing and Invariant Verification}, url = {http://dx.doi.org/10.1016/j.entcs.2009.10.015}, volume = {253}, year = {2009} }

TY - JOUR ID - citeulike:6051822 L3 - citeulike-article-id:6051822 N2 - From our previous work on biochemical applications, the structure of port graph (or multigraph with ports) and a rewriting calculus have proved to be well-suited formalisms for modeling interactions between proteins. Then port graphs have been proposed as a formal model for distributed resources and grid infrastructures, where each resource is modeled by a node with ports. The lack of global information and the autonomous and distributed behavior of components are modeled by a multiset of port graphs and rewrite rules which are applied locally, concurrently, and non-deterministically. Some computations take place wherever it is possible and in parallel, while others may be controlled by strategies. In this paper, we first introduce port graphs as graphs with multiple edges and loops, with nodes having explicit connection points, called ports, and edges attaching to ports of nodes. We then define an abstract biochemical calculus that instantiates to a rewrite calculus on these graphs. Rules and strategies are themselves port graphs, i.e. first-class objects of the calculus. As a consequence, they can be rewritten as well, and rules can create new rules, providing a way of modeling adaptive systems. This approach also provides a formal framework to reason about computations and to verify useful properties. We show how structural properties of a modeled system can be expressed as strategies and checked for satisfiability at each step of the computation. This provides a way to ensure invariant properties of a system. This work is a contribution to the formal specification and verification of adaptive systems and to theoretical foundations of autonomic computing. IS - 4 JF - Electronic Notes in Theoretical Computer Science SN - 15710661 EP - 38 TI - A Port Graph Calculus for Autonomic Computing and Invariant Verification VL - 253 SP - 17 AU - Andrei, Oana AU - Kirchner, Hélène PY - 2009/11/06/ UR - http://dx.doi.org/10.1016/j.entcs.2009.10.015 ER -