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 …

We present Executable Abstract Programs and analyse their role for software development
and documentation. The intuitive understanding of these programs fits the computational …

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 …

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 …

Based on the logic of non-deterministic Abstract State Machines (ASMs) we define a modal
extension ML ASM by first introducing multi-step predicates and then adding quantification …

Providing efficient theorem proving support for general ASM rules that update proper
functions, use sequential and parallel composition, nondeterministic choice and recursion is …

Over the last decades the field of computer science has changed a lot. In practice we are
now dealing with very complex systems, but it seems that the theoretical foundations have …

In 1985 Egon Börger published his influential monograph on computation theory, logic, and
complexity (Börger, 1989), which focused on the concept of formal language as a carrier of …

Through the use of smart terminal equipment such as smart meters, the operating data of the
entire power system can be collected, and then the collected power big data can be …

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 …