20126 search results - page 45 / 4026 » Timed Transition Systems |
ISSTA
1998
ACM
15 years 1 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
IUI
2005
ACM
15 years 3 months ago
2005
ACM
This paper describes SmartCanvas, an intelligent desk system that allows a user to perform freehand drawing on a desk or similar surface with gestures. Our system requires one cam...
ICTAC
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Given a nite state machine denoting the speci cation of a system, nding some short interaction sequences capable to reach some/all states or transitions of this machine...
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...