In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
—We address the problem of finding a mathematical model for the genetic network regulating the stress response of the yeast Saccharomyces cerevisiae to the fungicide mancozeb. A...
Abstract. Starting from a biochemical signalling pathway model expressed in a process algebra enriched with quantitative information we automatically derive both continuous-space a...
Muffy Calder, Adam Duguid, Stephen Gilmore, Jane H...
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
We discuss the issues involved in modelling and verifying key-exchange protocols within the framework of CSP and its model-checking tool FDR. Expressing such protocols within a pr...