Rigorous foundation of evolving concurrent systems
|Title||Rigorous foundation of evolving concurrent systems|
|Organization||Software Competence Center Hagenberg GmbH|
A concurrent system can be characterised by autonomously acting agents, each executing its own program using shared resources and communicating with each other, but otherwise being oblivious to the programs of other agents. In an evolving concurrent system agents may change their programs, enter or leave the collection at any time thereby changing the behaviour of the overall system. In this paper we investigate a behavioural theory of evolving concurrent systems integrating the simplified parallel ASM thesis, the concurrent ASM thesis and the reective ASM thesis, which provide behavioural theories for unbounded (synchronous) parallel algorithms, asynchronous concurrent systems, and reective algorithms, respectively. However, in the latter two theories only sequential agents and sequential reective algorithms were considered. Furthermore, linguistic reection has not been integrated with parallelism. We will thus show how these research gaps can be closed.