Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
Abstract. Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various pro...
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...