Distributed Adaptive Systems - Theory, Specification, Reasoning

A distributed system can be characterised by autonomously acting agents, where each agent executes its own program, uses shared resources and communicates with the others, but otherwise is totally oblivious to the behaviour of the other agents. In a distributed adaptive system agents may change their programs, and enter or leave the collection at any time thereby changing the behaviour of the overall system. This article first develops a language-independent axiomatic definition of distributed adaptive systems and then presents concurrent reflective Abstract State Machines (crASMs), an abstract machine model for their specification. It can be proven that any distributed adaptive system as stipulated by the axiomatisation can be step-by-step simulated by a crASM. Proofs about crASMs can be grounded in a multiple-step logic, which extends known complete one-step logics for deterministic and non-deterministic ASMs.

[1]  Klaus-Dieter Schewe,et al.  Evolving concurrent systems: behavioural theory and logic , 2017, ACSW.

[2]  Klaus-Dieter Schewe.  Concurrent Reflective Abstract State Machines , 2017, 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).

[3]  Egon Börger,et al.  The ASM Refinement Method , 2003, Formal Aspects of Computing.

[4]  Gidon Ernst,et al.  RGITL: A temporal logic framework for compositional reasoning about interleaved programs , 2014, Annals of Mathematics and Artificial Intelligence.

[5]  Klaus-Dieter Schewe,et al.  Partial Updates in Complex-Value Databases , 2011, EJC.

[6]  Klaus-Dieter Schewe,et al.  Communication in Abstract State Machines , 2017, J. Univers. Comput. Sci..

[7]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[8]  Andreas Blass,et al.  Abstract state machines capture parallel algorithms: Correction and extension , 2006, TOCL.

[9]  Robert F. Stärk,et al.  A Logic for Abstract State Machines , 2001, J. Univers. Comput. Sci..

[10]  Elvinia Riccobene,et al.  Towards ASM-Based Formal Specification of Self-Adaptive Systems , 2014, ABZ.

[11]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[12]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[13]  Klaus-Dieter Schewe,et al.  Concurrent abstract state machines , 2016, Acta Informatica.

[14]  Wolfgang Reif,et al.  How to Design and Implement Self-organising Resource-Flow Systems , 2011, Organic Computing.

[15]  Klaus-Dieter Schewe,et al.  Towards a Behavioural Theory for Random Parallel Computing , 2016, Computational Models of Rationality.

[16]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[17]  Klaus-Dieter Schewe,et al.  A new thesis concerning synchronised parallel computing - simplified parallel ASM thesis , 2015, Theor. Comput. Sci..

[18]  Egon Börger,et al.  Abstract State Machines , 2003 .

[19]  Martin Leucker,et al.  Guest editors’ preface to special issue on interval temporal logics , 2014, Annals of Mathematics and Artificial Intelligence.

[20]  Klaus-Dieter Schewe,et al.  A Customised ASM Thesis for Database Transformations , 2010, Acta Cybern..

[21]  Matthias Schmalz,et al.  Formalizing the logic of event-B: Partial functions, definitional extensions, and automated theorem proving , 2012 .

[22]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[23]  Klaus-Dieter Schewe,et al.  A complete logic for Database Abstract State Machines1 , 2016, Log. J. IGPL.

[24]  Wolfgang Reif,et al.  Combining PosoMAS Method Content with Scrum: Agile Software Engineering for Open Self-Organising Systems , 2015, Scalable Comput. Pract. Exp..

[25]  Antoni W. Mazurkiewicz,et al.  Introduction to Trace Theory , 1995, The Book of Traces.

[26]  Andreas Blass,et al.  Background of Computation , 2007, Bull. EATCS.

[27]  Stephan Merz,et al.  Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series) , 2010 .

[28]  C. Petri.  Kommunikation mit Automaten , 1962 .

[29]  Stephan Merz,et al.  On the Logic of TLA+ , 2003, Comput. Artif. Intell..

[30]  Klaus-Dieter Schewe,et al.  A Behavioural Theory for Reflective Sequential Algorithms , 2017, Ershov Informatics Conference.

[31]  Klaus-Dieter Schewe,et al.  A unifying logic for non-deterministic, parallel and concurrent abstract state machines , 2017, Annals of Mathematics and Artificial Intelligence.

[32]  Yuri Gurevich,et al.  Sequential abstract-state machines capture sequential algorithms , 2000, TOCL.

[33]  Andreas Blass,et al.  Abstract state machines capture parallel algorithms , 2003, TOCL.