Analyzing a distributed computation is a hard problem in general due to the combinatorial explosion in the size of the state-space with the number of processes in the system. By abstracting the computation, unnecessary state explorations can be avoided. Computation slicing is an approach for abstracting distributed computations with respect to a given predicate. We focus on regular predicates, ...

Polygonal knots are embeddings of polygons in three space. For each n, the collection of embedded n-gons determines a subset of Euclidean space whose structure is the subject of this paper. Which knots can be constructed with a specified number of edges? What is the likelihood that a randomly chosen polygon of n-edges will be a knot of a specific topological type? At what point is a given topol...

In this paper, we mainly focus on solving scheduling problems with model checking, where a finite number of entities needs to be processed as efficiently as possible, for instance by a machine. To solve these problems, we model them in untimed process algebra, where time is modelled using a special tick action. We propose a set of distributed state space explorations to find schedules for the m...

As system complexity grows, cycle-accurate simulation experiments become inordinately time consuming. Most approaches to accelerating architectural simulation model only portions of an application in detail. Detailed simulation begins with architectural state from earlier portions of the execution. Constructing this requires fast-forwarding: modeling effects of earlier instructions without mode...

Lunar dust particles are generated by hypervelocity impacts of interplanetary micrometer meteoroids onto the surface Moon, which seriously threatens security explorations. Studying lunar dynamics helps to understand origin and migration mechanism dust, provide theoretical guidelines for orbital design space missions. This paper reviews previous research on dynamics, including impactor environme...