On the complexity of determinizing monitors

We examine the determinization of monitors. We demonstrate that every monitor is equivalent to a deterministic one, which is at most doubly exponential in size with respect to the original monitor. When monitors are described as CCS-like processes, this doubly-exponential bound is optimal. When (deterministic) monitors are described as finite automata (as their LTS), then they can be exponentially more succinct than their CCS process form.peer-reviewe

Exact stationary state for a deterministic high speed traffic model with open boundaries

An exact solution for a high speed deterministic traffic model with open boundaries and synchronous update rule is presented. Because of the strong correlations in the model, the qualitative structure of the stationary state can be described for general values of the maximum speed. It is shown in the case of $v_{\rm max}=2$ that a detailed analysis of this structure leads to an exact solution. Explicit expressions for the stationary state probabilities are given in terms of products of $24\times 24$ matrices. From this solution an exact expression for the correlation length is derived.Comment: 20 pages, LaTeX, typos corrected and references adde

Software ENgineering Algebraic specification and coalgebraic synthesis of

CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms