This paper considers the small-world phenomenon in two contexts: ubiquitous computing and security. We argue that small-world properties emerge in ubicomp systems due to their nat...
A Global Cooperation Project was conducted with computer science classes at the Czech Technical University and North Hennepin Community College. The project was a pilot project fo...
Thomas Macek, Bozena Mannova, Josef Kolar, Barbara...
In this paper, we describe the computer tool Design CPN supporting editing, simulation, and state space analysis of Coloured Petri Nets. So far, approximately 40 man-years have bee...
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...