We present a comprehensive model of railway operations written in the active object
language ABS. The model is based on specifications taken from the rulebooks of Deutsche …

After a number of success stories in safety‐critical domains, we are starting to witness
applications of formal methods in contemporary systems and software engineering …

A behavioural theory consists of machine-independent postulates characterizing a particular
class of algorithms or systems, an abstract machine model that provably satisfies these …

Modern automotive systems with adaptive control features require rigorous analysis to
guarantee correct operation. We report our experience in modeling the automotive case …

Structures of Computing explains the behavioral meaning of fundamental concepts of
computing from a practical viewpoint and in generic terms, unrestricted by specific …

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 …

This paper presents a proof technique for proving refinements for general state-based
models of concurrent systems that reduces proving forward simulations to thread-local, step …

Choreographies prescribe the rendez-vous synchronisation of messages in a system of
communicating finite state machines. Such a system is called realisable, if the traces of the …

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