6 citations found. Retrieving documents...
M.A. Wermelinger. Specification of software architecture reconfiguration. Ph.D. thesis, Universidade Nova de Lisboa, September 1999.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
An Approach to Dynamic Reconfiguration of.. - Almeida, Wegdam.. (2001)   (2 citations)  (Correct)

....these systems provide. They have high availability, adaptability and maintainability requirements, and, in order to remain useful, they have to cope with advances in technology, modifications of their operating environment and ever changing human needs [10] The aim of dynamic reconfiguration [8, 9, 7, 1, 4, 11, 2, 10, 14, 18] is to allow a system to evolve at ran time [8] as opposed to design time, while introducing little (or ideally no) impact on the system s execution. In this way, systems do not have to be taken off line, rebooted or restarted to accommodate changes. Changes can be classified with relation to the ....

....state, all transactions involving Q are complete and no new transactions will be initiated. At this point Q has reached the quiescent (reconfiguration safe) state. Using this approach, even small reconfigurations involving a few entities result in substantial impact on the system s execution [10, 18]. This approach also places a heavy burden on the application programmer who must implement all entities of the system with capabilities to act correctly to a passivate command that sets an entity to a passive state [10, 2] In a passive state an entity shows reactive behavior. Moazami Goudarzi s ....

[Article contains additional citation context not shown here]

M.A. Wermelinger. Specification of software architecture reconfiguration. Ph.D. thesis, Universidade Nova de Lisboa, September 1999.


Transparent Dynamic Reconfiguration for CORBA - Almeida, Wegdam, van.. (2001)   (6 citations)  (Correct)

....system is determined by its downtime due to various types of maintenance. In practice, a reconfiguration implies that the system needs to be taken offline and restarted after installation of new software components. The downtime due to maintenance can be avoided by using dynamic reconfiguration [1, 3, 4, 5, 7, 9, 10 , 11 , 13 , 20 , 25], i.e. the system can be maintained or upgraded without being taken off line. The aim of dynamic reconfiguration is to allow a system to evolve at run time [9] as opposed to designtime, while introducing little (or ideally no) impact on the system s execution. In this way, the system does not ....

....does not address consistency issues explicitly and is heavily based on the use of an interpreted language for object implementation. Our approach only interferes with those parts of the system that actually interact with the set of affected objects during reconfiguration, contrary to approaches [3, 9, 11, 25] that block all potential system activities that may prevent the system from reaching the safe state. For a more extensive comparison of our approach with other non middleware specific dynamic reconfiguration approaches [9, 11 , 25] see [1] This paper focuses on reconfiguration of nonredundant ....

[Article contains additional citation context not shown here]

M. A. Wermelinger. Specification of software architecture reconfiguration. Ph.D. thesis, Universidade Nova de Lisboa, September 1999.


Dynamic Software Evolution and The K-Component Model - Dowling, Cahill (2001)   (1 citation)  (Correct)

.... software systems by supporting the self management and reconfiguration of the system s architecture at run time [Allen98] Current approaches to specifying dynamic software architectures use an Architecture Description Language (ADL) SG96] in conjunction with an Architecture Modification Language [Darwin95, Rapide95, Werm00] or a Co ordination Language [Cuesta01] Our approach to building a dynamic software architecture is to use architectural reflection [Caz00] A system that supports architectural reflection reifies its software architecture , e.g. its configuration graph of components and connectors, as an ....

....The root vertex of a configuration graph is a special type of vertex, the entry point in the program. It is normally the main( of a C Java implementation. Cycles are allowed in the graph and are modelled with cyclic connectors. A meta level component, called the configuration manager [KM98, Werm00] (see Fig. 3) is responsible for the storage and management of the software architecture s configuration graph. Interface Component Vertex Connector [Label] Interface Component Cyclic Connector [Label] Label = Local Remote, Compression Interceptor] Vertex = Interface, ....

[Article contains additional citation context not shown here]

Michel Wermelinger, Specification of Software Architecture Reconfiguration, PhD Thesis Universidade Nove de Lisboa, 2000.


The K-Component Architecture Meta-Model for Self-Adaptive.. - Dowling, Cahill (2001)   (3 citations)  (Correct)

.... Dynamic software architectures can be used to build dynamic systems by supporting the selfmanagement and reconfiguration of the dynamic system s architecture at run time [Allen98] Current approaches to specifying dynamic software architectures use ADLs with Architecture Modification Languages [Darwin95, OGT99, Rapide95, Werm00] or Co ordination Languages [Cuesta01] Another approach to specifying dynamic software architectures is to use architectural reflection [Caz00] A system that supports architectural reflection reifies its architectural features as an architecture metamodel [Blair01] that can be inspected and ....

....between adaptable and self adaptive systems. Adaptable systems can be adapted to a particular deployment environment [Czarn00] whereas self adaptive systems adapt themselves to their operating environment [OGT99] Adaptable systems support their explicit adaptation by an external actor [Werm00] using either a procedural or declarative interface [Blair01] Adaptable systems with procedural interfaces are open dynamic systems and can support arbitrary or evolutionary adaptations [MG99] Self adaptive systems, however, are subject to implicit adaptation, triggered by changes in either ....

[Article contains additional citation context not shown here]

Michel Wermelinger, Specification of Software Architecture Reconfiguration, PhD Thesis Universidade Nove de Lisboa, 2000.


An Approach to Dynamic Reconfiguration of.. - Almeida, Wegdam.. (2001)   (2 citations)  (Correct)

....these systems provide. They have high availability, adaptability and maintainability requirements, and, in order to remain useful, they have to cope with advances in technology, modifications of their operating environment and ever changing human needs [10] The aim of dynamic reconfiguration [8, 9, 7, 1, 4, 11, 2, 10, 14, 18] is to allow a system to evolve at run time [8] as opposed to design time, while introducing little (or ideally no) impact on the system s execution. In this way, systems do not have to be taken off line, rebooted or restarted to accommodate changes. Changes can be classified with relation to the ....

....state, all transactions involving Q are complete and no new transactions will be initiated. At this point Q has reached the quiescent (reconfiguration safe) state. Using this approach, even small reconfigurations involving a few entities result in substantial impact on the system s execution [10, 18]. This approach also places a heavy burden on the application programmer who must implement all entities of the system with capabilities to act correctly to a passivate command that sets an entity to a passive state [MG99, BISZ98] In a passive state an entity shows reactive behaviour. ....

[Article contains additional citation context not shown here]

M. A. Wermelinger. Specification of software architecture reconfiguration. Ph.D. thesis, Universidade Nova de Lisboa, September 1999.


A Graph Transformation Approach to Software Architecture.. - Wermelinger, Fiadeiro (2000)   (11 citations)  Self-citation (Wermelinger)   (Correct)

....list(int) for lists of integers. A value for a list is written [l 1 , l 2 , and thus [ is the empty list. The operations head and tail perform as usual, and represents list concatenation. Formal definitions and proofs of the results in this and the next section can be found in [30,16]. 2.1 Programs The syntax of a CommUnity program is prog P in in(V ) out out(V ) prv prv(V ) init I do [ a#sh(A) a : G(a) # # l#D(a) l : E (a, l) a#prv(A) prv a : G(a) # # l#D(a) l : E (a, l) where . in(V ) is the set of input variables. They are imported from the ....

M. Wermelinger. Specification of Software Architecture Reconfiguration. PhD thesis, Universidade Nova de Lisboa, Sept. 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC