The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Abstract. In the first part of this article we introduce the notion of a backwardforward conditioning (BFC) system that generalises the notion of zero-class admissibiliy introduce...