We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
Abstract. We introduce a generalised notion of a real-time speci cation language (\GPLC-Automata") that can be translated directly into real-time programs. In order to describ...
Abstract. In this paper we describe the formal specification and verification of the efficient algorithm for real-time model checking implemented in the model checker RAVEN. It was...
Abstract. XML documents are described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properti...