Dynamic reconfiguration of GCM components

We detail in this report past research and current/future developments in formal specification of Grid component systems by temporal logic and consequent resolution technique, for an automated dynamic reconfiguration of components. It is analysed the specification procedure of GCM (Grid Component Model) components and infrastructure in respect to their state behaviour, and the verification process in a dynamic and reconfigurable distributed system. Furthermore it is demonstrated how an automata based method is used to achieve the specification, as well as how the enrichment of the temporal specification language of Computation Tree Logic CTL with the ability to capture norms, allows to formally define the concept of reconfiguration.

[1]  Helmut Veith,et al.  Temporal Logic Model Checking , 2005, Handbook of Networked and Embedded Control Systems.

[2]  Thaís Vasconcelos Batista,et al.  Managing Dynamic Reconfiguration in Component-Based Systems , 2005, EWSA.

[3]  Vladimir Getov,et al.  Towards Building a Generic Grid Services Platform: A Component-Oriented Approach , 2005 .

[4]  Carole Goble,et al.  Enhancing Services and Applications with Knowledge and Semantics , 2004, The Grid 2, 2nd Edition.

[5]  Alexander Bolotov.  A clausal resolution for extended computation tree logic ECTL , 2003 .

[6]  Clare Dixon,et al.  Resolution in a Logic of Rational Agency , 2000 .

[7]  Alexander Bolotov,et al.  Automated Natural Deduction for Propositional Linear-Time Temporal Logic , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

[8]  Alexander Bolotov,et al.  Specification and Verification of Reconfiguration Protocols in Grid Component Systems , 2006 .

[9]  Alexander Bolotov,et al.  Automated First Order Natural Deduction , 2005, IICAI.

[10]  Alessio Lomuscio,et al.  A Complete and Decidable Axiomatisation for Deontic Interpreted Systems , 2006, DEON.

[11]  Michael Fisher,et al.  A clausal resolution method for CTL branching-time temporal logic , 1999, J. Exp. Theor. Artif. Intell..

[12]  Yan Zhang,et al.  CTL Model Update: Semantics, Computations and Implementation , 2006, ECAI.

[13]  Alexander Bolotov,et al.  Search strategies for resolution in CTL-type logics: extension and complexity , 2005, 12th International Symposium on Temporal Representation and Reasoning (TIME'05).

[14]  John C. Knight,et al.  Assured reconfiguration of embedded real-time software , 2004, International Conference on Dependable Systems and Networks, 2004.

[15]  Alexander Bolotov,et al.  Natural Deduction Calculus for Computation Tree Logic , 2006, IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06).

[16]  Alexander Bolotov,et al.  Natural Deduction Calculus for Linear-Time Temporal Logic , 2006, JELIA.

[17]  Zohar Manna,et al.  Temporal Specification and Verification of Reactive Modules , 1992 .

[18]  Clare Dixon,et al.  Tractable Temporal Reasoning , 2007, IJCAI.

[19]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[20]  Georg Gottlob,et al.  On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..

[21]  A. Prasad Sistla,et al.  Deciding Full Branching Time Logic , 1985, Inf. Control..