5055 search results - page 86 / 1011 » Relative Timing |
123
Voted
FORMATS
2005
Springer
15 years 8 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
119
Voted
ACSD
2009
IEEE
15 years 6 months ago
2009
IEEE
A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrent systems. Among them, the...
131
click to vote
AAAI
2008
15 years 4 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
115
Voted
ICTAI
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in th...
107
Voted
HYBRID
1995
Springer
15 years 6 months ago
1995
Springer
This paper summarizes the definitions and several of the main results of an approach to hybrid systems, which combines finite automata and linear systems, developed by the author...