Signal Transition Graphs (STG) are a formalism for the description of asynchronous circuit behaviour. In this paper we propose (and justify) a formal semantics of nondeterministic...
— In this paper we present the Secure Dynamic Source Routing protocol for Mobile Ad hoc Networks that prevents a lot of potential attacks to these kind of networks. We also prese...
Frank Kargl, Alfred Geiss, Stefan Schlott, Michael...
We describe two improvements made to CD++, a tool for modeling and simulation of cellular models based on the Cell-DEVS formalism. The modifications described in this work remove s...
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
Abstract. The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global st...