184 search results - page 19 / 37 » A New Algorithm of Constructing the Basis Finite Automaton |
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
139
Voted
AWPN
2008
15 years 1 months ago
2008
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
186
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Database columns are often correlated, so that cardinality estimates computed by assuming independence often lead to a poor choice of query plan by the optimizer. Multidimensional...
117
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
— In this paper, we propose a new on-line learning algorithm for the non-linear system identification: the swarm intelligence aided multi-innovation recursive least squares (SIM...