Adaptable processes
From MaRDI portal
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.
Recommendations
Cited in
(16)- Replication, refinement \& reachability: complexity in dynamic condition-response graphs
- On primitives for compensation handling as adaptable processes
- How adaptive and reliable is your program?
- Declarative event based models of concurrency and refinement in psi-calculi
- Chemistry-inspired adaptive stream processing
- Adaptable transition systems
- Modelling adaptive systems in ForSyDe
- Formalizing adaptation on-the-fly
- Modelling evolvable systems: a temporal logic view
- Event-based run-time adaptation in communication-centric systems
- Self-adaptation and secure information flow in multiparty communications
- On compensation primitives as adaptable processes
- Safety, liveness and run-time refinement for modular process-aware information systems with dynamic sub processes
- A white box perspective on behavioural adaptation
- Modular rewritable Petri nets: an efficient model for dynamic distributed systems
- Incremental model checking of delta-oriented software product lines
This page was built for publication: Adaptable processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899113)
