45 citations · 82 across the 16 of their papers we have counts for
19 papers
A Behavioural Theory of Probabilistic Algorithms Using Probabilistic Abstract State Machines
Flavio Ferrarotti, Klaus-Dieter Schewe
We motivate an axiomatic definition of probabilistic algorithms (PAs) by four postulates covering random branching time, abstract states, background, and random bounded exploration…
TREBL -- A Relative Complete Temporal Event-B Logic. Part I: Theory
Klaus-Dieter Schewe, Flavio Ferrarotti, Peter Rivière +3
The verification of liveness conditions is an important aspect of state-based rigorous methods. This article addresses the extension of the logic of Event-B to a powerful logic, in…
Behavioural Theory of Reflective Algorithms II: Reflective Parallel Algorithms
Klaus-Dieter Schewe, Flavio Ferrarotti
We develop a behavioural theory of reflective parallel algorithms (RAs), i.e. synchronous parallel algorithms that can modify their own behaviour. The theory comprises a set of pos…
A Complete Fragment of LTL(EB)
Flavio Ferrarotti, Peter Rivière, Klaus-Dieter Schewe +2
The verification of liveness conditions is an important aspect of state-based rigorous methods. This article investigates this problem in a fragment LTL of the logic LTL(E…
Choiceless Polynomial Space
Flavio Ferrarotti, Klaus-Dieter Schewe
Abstract State Machines (ASMs) provide a model of computations on structures rather than strings. Blass, Gurevich and Shelah showed that deterministic PTIME-bounded ASMs define the…
Completeness in Polylogarithmic Time and Space
Flavio Ferrarotti, Senen Gonzalez, Klaus-Dieter Schewe +1
Complexity theory can be viewed as the study of the relationship between computation and applications, understood the former as complexity classes and the latter as problems. Compl…