A concurrent system can be characterised by autonomously acting agents, where each
agent executes its own program, uses shared resources and communicates with the others …

We develop a behavioural theory of reflective sequential algorithms (RSAs), ie sequential
algorithms that can modify their own behaviour. The theory comprises a set of language …

Abstract “What is an algorithm?” is a fundamental question of computer science. Gurevich's
behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial …

Reflection is a technique that enables a system to inspect or change its structure and/or
behavior at runtime. It is a key enabler of many techniques for developing systems that have …

Reflective algorithms are algorithms that can modify their own behaviour. Recently a
behavioural theory of reflective algorithms has been developed, which shows that they are …

The development of code for software intensive systems involves numerous levels of
abstraction, leading from requirements to code. Having abstract modeling concepts …

We are interested in specifications which provide a consistent high-level view of systems.
They should abstract irrelevant details and provide a precise and complete description of the …

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 …

We are interested in specifications which provide a consistent high-level view of systems.
They should abstract irrelevant details and provide a precise and complete description of the …

The core of a distributed system can be characterised by autonomously acting agents,
where each agent executes its own program, uses shared resources and communicates …