516 search results - page 16 / 104 » Generalizing the Discrete Timed Automaton |
COMPGEOM
2011
ACM
13 years 1 months ago
2011
ACM
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
EMSOFT
2008
Springer
13 years 11 months ago
2008
Springer
Relations between models are important for effective automatic validation, for comparing implementations with specifications, and for increased understanding of embedded systems d...
COMPGEOM
1993
ACM
14 years 1 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
PODS
2009
ACM
14 years 10 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
TIME
1994
IEEE
14 years 1 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...