An “abstract process” approach to algebraic dynamic architecture description

Cuesta, Carlos E.; Fuente, Pablo de la; Barrio, Manuel Gértrudix; Beato, M. Encarnación

doi:10.1016/j.jlap.2004.05.003

Cited by 9 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While some of them are based on process calculi, none of them relies on suspension-like constructs to formalize evolution/adaptation. Below we review some of them; we refer the reader to [13,12,36,25] for more extensive reviews.…”

Section: Related Work and Discussionmentioning

confidence: 99%

Adaptable processes

Bravetti¹,

Giusto²,

Pérez³

et al. 2012

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We propose the concept of adaptable processes as a way of overcoming the limitations that process calculi have for describing patterns of dynamic process evolution. Such patterns rely on direct ways of controlling the behavior and location of running processes, and so they are at the heart of the adaptation capabilities present in many modern concurrent systems. Adaptable processes have a location and are sensible to actions of dynamic update at runtime; this allows to express a wide range of evolvability patterns for concurrent processes. We introduce a core calculus of adaptable processes and propose two verification problems for them: bounded and eventual adaptation. While the former ensures that the number of consecutive erroneous states that can be traversed during a computation is bound by some given number k, the latter ensures that if the system enters into a state with errors then a state without errors will be eventually reached. We study the (un)decidability of these two problems in several variants of the calculus, which result from considering dynamic and static topologies of adaptable processes as well as different evolvability patterns. Rather than a specification language, our calculus intends to be a basis for investigating the fundamental properties of evolvable processes and for developing richer languages with evolvability capabilities.

show abstract

Section: Related Work and Discussionmentioning

confidence: 99%

Adaptable processes

Bravetti¹,

Giusto²,

Pérez³

et al. 2012

Logical Methods in Computer Science

View full text Add to dashboard Cite

show abstract

“…Few ADLs support dynamic architecture representation: Darwin (Magee et al, 1995), Dynamic Wright (Allen et al, 1998), -Space (Chaudet & Oquendo, 2000), C2SADEL (Medvidovic et al, 1999;, Piccola (Nierstrasz & Achermann, 2000), Pilar (Cuesta et al, 2005), ArchWare -ADL Oquendo 2004), ArchWare C&C-ADL . Most of them are not suitable to support unplanned dynamic architecture evolution as they consider different representations for the concrete and abstract levels, and use reflection mechanisms to switch among these representations: a dynamic architecture is first defined at abstract level and is then reflected (1) into a dynamic evolvable concrete software-intensive system (Cazzola et al, 1999;Tisato et al, 2000) or (2) into another, evolved abstract representation (Cuesta et al, 2001;Cuesta et al, 2005). The link between the abstract level and the concrete one is not maintained, leading to a situation in which only anticipated modifications can be supported dynamically.…”

Section: Related Workmentioning

confidence: 99%

An Architecture-Centric Approach for Information System Architecture Modeling, Enactement and Evolution

Verjus¹,

Cimpan²,

Alloui³

2012

Innovative Information Systems Modelling Techniques

View full text Add to dashboard Cite

show abstract

“…Customers use the same port to pay for expenses and pump oil. Consequently collision may be occurred (Cuesta et al, 2005). In this section, the gas station is modeled by SAFM shown in Fig.…”

Section: Example: Modeling and Analyzing Gas-station Problemmentioning

confidence: 99%