This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan
We explore techniques from visualization and computational geometry to make tactical information more intuitive to a military commander. To be successful, the commander must quick...
C. M. Hoffman, Y.-J. Kim, R. P. Winkler, J. D. Wal...
This paper is concerned with the transparent parallelisation of declarative database queries, based on theoretical principles. We have designed an entire database architecture sui...
Mohamad Afshar, J. Bates, Gavin M. Bierman, K. Moo...
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...